There is but one PDS in $\mathbb{Z}^{3}$ inducing just square components
Italo J. Dejter, Luis R. Fuentes, Carlos A. Araujo

TL;DR
This paper proves the uniqueness of a specific dominating set in the lattice whose induced components are exclusively 4-cycles, highlighting a unique structural property of the lattice's unit distance graph.
Contribution
The paper establishes the uniqueness of a dominating set with 4-cycle components in the lattice's unit distance graph, a previously unknown structural result.
Findings
The dominating set with 4-cycle components is unique in .
Each vertex outside the dominating set has a unique neighbor in the set.
The structure of the dominating set is rigid and uniquely determined.
Abstract
It is known that in the unit distance graph of the lattice there exists a dominating set with -cycles as sole induced components and each vertex of having a unique neighbor in . We show is unique.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
