Identifying codes of lexicographic product of graphs
From MaRDI portal
Publication:1953370
zbMath1264.94119arXiv1106.3607MaRDI QIDQ1953370
Kaishun Wang, Min Feng, Min Xu
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.3607
Applications of graph theory (05C90) Combinatorial codes (94B25) Graph operations (line graphs, products, etc.) (05C76)
Related Items (10)
On identifying codes in the Cartesian product of a path and a complete graph ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Identifying codes of the direct product of two cliques ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ New results of identifying codes in product graphs
This page was built for publication: Identifying codes of lexicographic product of graphs