Optimal identifying codes in cycles and paths

DOI10.1007/S00373-011-1058-6MaRDI QIDQ1926037zbMATH OpenOpenAlexFDO

Authors Ville Junnila, Tero Laihonen

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

cycleidentifying codeoptimal codepath

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)

Recommendations

• Identifying codes of cycles
• On identifying codes
• Identifying codes in some subgraphs of the square lattice
• Identifying and locating-dominating codes on chains and cycles
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)

Cites work

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 1735664 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Identifying and locating-dominating codes on chains and cycles
• Identifying codes of cycles
• Identifying codes of cycles with odd orders
• Locating sensors in paths and cycles: the case of 2-identifying codes
• On \(r\)-locating-dominating sets in paths
• On a new class of codes for identifying vertices in graphs

Cited in

(17)

• Identifying codes in the direct product of a complete graph and some special graphs
• The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
• Optimal identifying codes of two families of Cayley graphs
• Improved upper bounds for identifying codes in n-dimensional q-ary cubes
• On two variations of identifying codes
• Optimal bounds on codes for location in circulant graphs
• New results on variants of covering codes in Sierpiński graphs
• Identifying codes of the direct product of two cliques
• Identifying codes of corona product graphs
• Identifying codes of cycles
• Locating-domination and identification
• Identifying path covers in graphs
• Extension of universal cycles for globally identifying colorings of cycles
• Identifying codes in the direct product of a path and a complete graph
• Various bounds for liar's domination number
• Identifying codes in vertex-transitive graphs and strongly regular graphs
• Identifying codes of cycles with odd orders

This page was built for publication: Optimal identifying codes in cycles and paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926037)