Identifying codes of cycles with odd orders
From MaRDI portal
Publication:942141
DOI10.1016/j.ejc.2007.09.006zbMath1145.94020OpenAlexW2014565352MaRDI QIDQ942141
Krishnaiyan Thulasiraman, Min Xu, Xiao-Dong Hu
Publication date: 4 September 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.09.006
Related Items (16)
New results on variants of covering codes in Sierpiński graphs ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Optimal identifying codes in cycles and paths ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ Identifying codes of the direct product of two cliques ⋮ Locating and identifying codes in circulant networks ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ Complexity results for identifying codes in planar graphs ⋮ New results of identifying codes in product graphs ⋮ On two variations of identifying codes ⋮ Locating-Domination and Identification ⋮ Optimal bounds on codes for location in circulant graphs
Cites Work
- Identifying codes in some subgraphs of the square lattice
- Codes identifying sets of vertices in random networks
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- 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
- Unnamed Item
This page was built for publication: Identifying codes of cycles with odd orders
