On the ensemble of optimal dominating and locating-dominating codes in a graph

DOI10.1016/j.ipl.2015.04.005zbMath1329.05234OpenAlexW2093832088MaRDI QIDQ2346565

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

Publication date: 2 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.04.005

zbMATH Keywords

combinatorial problemsdominationJohnson graphslocating-dominating codes

Mathematics Subject Classification ID

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

Related Items

On the ensemble of optimal identifying codes in a twin-free graph, Which graphs occur as \(\gamma\)-graphs?, On the binary locating-domination number of regular and strongly-regular graphs, The binary locating-dominating number of some convex polytopes, On the number of optimal identifying codes in a twin-free graph, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, Binary locating-dominating sets in rotationally-symmetric convex polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ensemble of optimal identifying codes in a twin-free graph
• Induced subgraphs of Johnson graphs
• Johnson graphs are Hamilton-connected
• Total Domination in Graphs