Maximum size of a minimum watching system and the graphs achieving the bound

DOI10.1016/j.dam.2012.08.028zbMath1321.05136OpenAlexW1991443063MaRDI QIDQ496659

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

Publication date: 22 September 2015

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

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

zbMATH Keywords

identifying codeswatching systems

Mathematics Subject Classification ID

Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items

Watching systems in the King grid, On the watching number of graphs using discharging procedure, Unnamed Item, Watching systems in graphs: an extension of identifying codes, Maximum size of a minimum watching system and the graphs achieving the bound, Locating-Domination and Identification

Uses Software

• OEIS

Cites Work

• Maximum size of a minimum watching system and the graphs achieving the bound
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• On the identification of vertices using cycles
• Extremal graphs for the identifying code problem
• Watching systems in graphs: an extension of identifying codes
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item