Answer to an isomorphism problem in Z^2

MaRDI QIDQ5012280zbMATH OpenFDO

Authors Matt Noble

Publication date 31 August 2021

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

zbMATH Keywords

Euclidean distance graphgraph isomorphisms

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: For $Ssubsetmathbb{R}^n$ and $d>0$, denote by $G(S,d)$ the graph with vertex set $S$ with any two vertices being adjacent if and only if they are at a Euclidean distance $d$ apart. Deem such a graph to be ``non-trivial" if $d$ is actually realized as a distance between points of $S$. In a 2015 article, the author asked if there exist distinct $d_1,d_2$ such that the non-trivial graphs $G(mathbb{Z}^2,d_1)$ and $G(mathbb{Z}^2,d_2)$ are isomorphic. In our current work, we offer a straightforward geometric construction to show that a negative answer holds for this question.

Recommendations

• An Isomorphism Problem in Z^2
• Isomorphism classes of distance graphs in \(\mathbb{Q}^3\)
• On single-distance graphs on the rational points in Euclidean spaces
• A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)
• Chromatic numbers of two-distance graphs in Q^2

Cited in

(1)

• An Isomorphism Problem in Z^2

This page was built for publication: Answer to an isomorphism problem in \(\mathbb{Z}^2\)

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