Recognition: unknown
Identifying codes of lexicographic product of graphs
classification
🧮 math.CO
keywords
codesidentifyingproductgraphgraphslexicographicarbitrarycardinality
read the original abstract
Gravier et al. investigated the identifying codes of Cartesian product of two graphs. In this paper we consider the identifying codes of lexicographic product G[H] of a connected graph G and an arbitrary graph H, and obtain the minimum cardinality of identifying codes of G[H] in terms of some parameters of G and H.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.