Identifying codes of lexicographic product of graphs
From MaRDI portal
Publication:1953370
zbMATH Open1264.94119arXiv1106.3607MaRDI QIDQ1953370FDOQ1953370
Authors: Min Feng, Min Xu, Kaishun Wang 
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1106.3607
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Applications of graph theory (05C90) Graph operations (line graphs, products, etc.) (05C76) Combinatorial codes (94B25)
Cited In (13)
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- On identifying codes in the Cartesian product of a path and a complete graph
- Identifying codes of Cartesian product of two cliques of the same size
- Characterizing identifying codes from the spectrum of a graph or digraph
- Identifying codes in the direct product of a complete graph and some special graphs
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- Optimal identifying codes of two families of Cayley graphs
- SPC product codes, graphs with cycles and Kostka numbers
- New results of identifying codes in product graphs
- Path 3-(edge-)connectivity of lexicographic product graphs
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
- Identifying codes in vertex-transitive graphs and strongly regular graphs
This page was built for publication: Identifying codes of lexicographic product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953370)
