There is but one PDS in Z^3 inducing just square components

MaRDI QIDQ4566153zbMATH OpenFDO

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

Publication date 14 June 2018

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

zbMATH Keywords

integer latticeperfect dominating setsunit distance graph

Mathematics Subject Classification ID

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

Abstract: It is known that in the unit distance graph of the lattice $mathbb{Z}^{3}subsetmathbb{R}^3$ there exists a dominating set $S$ with $4$-cycles as sole induced components and each vertex of $mathbb{Z}^{3}setminusS$ having a unique neighbor in $S$. We show $S$ is unique.

Recommendations

• Rainbow perfect domination in lattice graphs
• Domination number of unit graph of \(\mathbb {Z}_n\)
• Dominating sets in n‐cubes
• Domination of graphs in \(\mathbf{Z}^{n}_{p}\) and in \(\mathbf{Z}^{n}_{3} \times \mathbf{Z}^{m}_{2}\)
• Geometric dominating sets -- a minimum version of the no-three-in-line problem

Cited in

(3)

• Perfect codes in Euclidean lattices
• Rainbow perfect domination in lattice graphs
• Perfect truncated-metric codes in lattice graphs and superlattice graphs

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

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