Possible cardinalities for locating-dominating codes in graphs

zbMATH Open1101.05045MaRDI QIDQ5487899FDOQ5487899

Antoine Lobstein, Irène Charon, Olivier Hudry

Publication date: 13 September 2006

Recommendations

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Locating-dominating codes in cycles
• Locating vertices using codes
• On locating-dominating codes for locating large numbers of vertices in the infinite king grid
• The compared costs of domination location-domination and identification

zbMATH Keywords

graph domination

Mathematics Subject Classification ID

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

Cited In (8)

• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• Locating vertices using codes
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Solving Two Conjectures regarding Codes for Location in Circulant Graphs
• Locating-dominating codes: bounds and extremal cardinalities
• The compared costs of domination location-domination and identification
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• Locating-Domination and Identification

This page was built for publication: Possible cardinalities for locating-dominating codes in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487899)