Optimal identifying codes in cycles and paths

DOI10.1007/s00373-011-1058-6zbMath1256.05124OpenAlexW2058416845MaRDI QIDQ1926037

Tero Laihonen, Ville Junnila

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1058-6

zbMATH Keywords

cyclepathoptimal codeidentifying code

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60)

Related Items

The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations, New results on variants of covering codes in Sierpiński graphs, Optimal identifying codes of two families of Cayley graphs, Identifying codes in vertex-transitive graphs and strongly regular 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, Extension of universal cycles for globally identifying colorings of cycles, On two variations of identifying codes, Various bounds for liar's domination number, Locating-Domination and Identification, Optimal bounds on codes for location in circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Identifying codes of cycles with odd orders
• On \(r\)-locating-dominating sets in paths
• Identifying and locating-dominating codes on chains and cycles
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Identifying codes of cycles
• On a new class of codes for identifying vertices in graphs