On the number of optimal identifying codes in a twin-free graph

DOI10.1016/j.dam.2014.08.020zbMath1303.05138OpenAlexW1999993502MaRDI QIDQ476309

Olivier Hudry, Iiro S. Honkala, Antoine C. Lobstein

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.020

zbMATH Keywords

identifying codestwin-free graphsidentifiable graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Related Items (6)

On the ensemble of optimal identifying codes in a twin-free graph ⋮ Some results about a conjecture on identifying codes in complete suns ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Unique (optimal) solutions: complexity results for identifying and locating-dominating codes ⋮ Extension of universal cycles for globally identifying colorings of cycles ⋮ Locating-Domination and Identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ensemble of optimal identifying codes in a twin-free graph
• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• Identifying codes of Cartesian product of two cliques of the same size
• 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
• On the ensemble of optimal dominating and locating-dominating codes in a graph
• Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
• On a new class of codes for identifying vertices in graphs
• Total Domination in Graphs
• Combinatorial bounds via measure and conquer

This page was built for publication: On the number of optimal identifying codes in a twin-free graph