On locating-dominating codes for locating large numbers of vertices in the infinite king grid

MaRDI QIDQ3101008zbMATH OpenFDO

Authors Mikko Pelto

Publication date 22 November 2011

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Other types of codes (94B60)

Recommendations

• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• On locating-dominating codes in the infinite king grid.
• Possible cardinalities for locating-dominating codes in graphs
• Identifying and locating-dominating codes on chains and cycles

Cited in

(6)

• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• On identifying codes in the King grid that are robust against edge deletions
• Possible cardinalities for locating-dominating codes in graphs
• scientific article; zbMATH DE number 6889668 (Why is no real title available?)
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• On locating-dominating codes in the infinite king grid.

This page was built for publication: On locating-dominating codes for locating large numbers of vertices in the infinite king grid

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