On the Structure of Identifiable Graphs

DOI10.1016/j.endm.2005.06.094zbMath1200.05188OpenAlexW2071845028MaRDI QIDQ3439386

Irène Charon, Olivier Hudry, Antoine C. Lobstein

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.094

zbMATH Keywords

pathsgraph theorytreescodesidentifiable graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Minimum sizes of identifying codes in graphs differing by one edge

Cites Work

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• On a new class of codes for identifying vertices in graphs
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: On the Structure of Identifiable Graphs