There is but one PDS in $\mathbb{Z}^{3}$ inducing just square components

zbMath1395.05124arXiv1706.08165MaRDI QIDQ4566153

Carlos A. G. jun. Araújo, Luis R. Fuentes, Italo Jose Dejter

Publication date: 14 June 2018

Full work available at URL: https://arxiv.org/abs/1706.08165

zbMATH Keywords

integer latticeunit distance graphperfect dominating sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Related Items (2)

Perfect codes in Euclidean lattices ⋮ Rainbow perfect domination in lattice graphs

This page was built for publication: There is but one PDS in $\mathbb{Z}^{3}$ inducing just square components