New results of identifying codes in product graphs

Sheyda Maddah, Modjtaba Ghorbani and Matthias Dehmer

Applied Mathematics and Computation, 2021, vol. 410, issue C

Abstract: For the vertex v of graph G and the subset N⊆V(G) of the vertex set, let IN(v)={N∩NG[v]}. If, for all vertices v’s of G, IN(v)’s are distinct non-empty sets, then N is said to be an identifying code and we indicate it by i(G). A graph G is called identifiable, if distinct vertices of this graph have distinct closed neighboods. In the current work, we investigate some upper bounds for the identifying code of given graph products.

Keywords: Identifying code; Graph products; Domination number (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005270
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321005270

DOI: 10.1016/j.amc.2021.126438

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().