An Isomorphism Problem in Z^2

Citation data:

Theory and Applications of Graphs, ISSN: 2470-9859, Vol: 2, Issue: 1, Page: 1

Publication Year:
2015
Usage 186
Abstract Views 103
Downloads 83
Repository URL:
https://digitalcommons.georgiasouthern.edu/tag/vol2/iss1/1
DOI:
10.20429/tag.2015.020101
Author(s):
Noble, Matt
Publisher(s):
Georgia Southern University
Tags:
Euclidean distance graph; graph isomorphisms; Discrete Mathematics and Combinatorics
article description
We consider Euclidean distance graphs with vertex set Q2 or Z2 and address the possibility or impossibility of finding isomorphisms between such graphs. It is observed that for any distances d1, d2 the non-trivial distance graphs G(Q2, d1) and G(Q2, d2) are isomorphic. Ultimately it is shown that for distinct primes p1, p2 the non-trivial distance graphs G(Z2, sqrt{p1}) and G(Z2, sqrt{p2}) are not isomorphic. We conclude with a few additional questions related to this work.