arXiv Analytics

Sign in

arXiv:2312.15336 [math.CO]AbstractReferencesReviewsResources

The Gray graph is a unit-distance graph

Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski

Published 2023-12-23Version 1

In this note we give a construction proving that the Gray graph, which is the smallest cubic semi-symmetric graph, is a unit-distance graph.

Comments: 7 pages, 5 figures
Categories: math.CO
Subjects: 05C62, 05E18, 20B25, 05C75, 05C76, 05C10
Related articles: Most relevant | Search more
arXiv:1607.04703 [math.CO] (Published 2016-07-16)
Graph Hausdorff dimension, Kolmogorov complexity and construction of fractal graphs
arXiv:1203.0709 [math.CO] (Published 2012-03-04)
On constructions and parameters of symmetric configurations v_{k}
arXiv:1606.06782 [math.CO] (Published 2016-06-21)
A construction of distance cospectral graphs

Links

Toolbox