An Isomorphism Problem in Z^2

We consider Euclidean distance graphs with vertex set Q<sup>2</sup> or Z<sup>2</sup> and address the possibility or impossibility of finding isomorphisms between such graphs. It is observed that for any distances d<sub>1</sub>, d<sub>2</sub> the non-tr...

Full description

Bibliographic Details
Main Author: Matt Noble
Format: Article
Language:English
Published: Georgia Southern University 2015-01-01
Series:Theory and Applications of Graphs
Subjects:
Online Access:https://digitalcommons.georgiasouthern.edu/tag/vol2/iss1/1