On graphs having a \(V\setminus \{x\}\) set as an identifying code
From MaRDI portal
Publication:864130
DOI10.1016/J.DISC.2005.09.035zbMath1127.05071OpenAlexW2004251646MaRDI QIDQ864130
Julien Moncel, Sylvain Gravier
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.035
Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (27)
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations ⋮ Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets ⋮ Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Extremal cardinalities for identifying and locating-dominating codes in graphs ⋮ Identifying Codes in Line Graphs ⋮ A linear-time algorithm for the identifying code problem on block graphs ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Extremal graphs for the identifying code problem ⋮ On the size of identifying codes in triangle-free graphs ⋮ Watching systems in graphs: an extension of identifying codes ⋮ On three domination-based identification problems in block graphs ⋮ Maximum size of a minimum watching system and the graphs achieving the bound ⋮ Polyhedra associated with identifying codes in graphs ⋮ Operads of finite posets ⋮ On the minimum size of an identifying code over all orientations of a graph ⋮ Unnamed Item ⋮ Minimum sizes of identifying codes in graphs differing by one edge ⋮ The compared costs of domination location-domination and identification ⋮ Strong identification codes for graphs ⋮ On Iiro Honkala's contributions to identifying codes ⋮ Locating-Domination and Identification ⋮ Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs ⋮ On the Structure of Identifiable Graphs
Cites Work
This page was built for publication: On graphs having a \(V\setminus \{x\}\) set as an identifying code
