Authors
- Leah Wrenn Berman University of Alaska Fairbanks, United States https://orcid.org/0000-0003-0935-5724
- Gábor Gévay University of Szeged, Hungary https://orcid.org/0000-0002-5469-5165
- Tomaž Pisanski University of Primorska, Slovenia and Institute of Mathematics, Physics and Mechanics, Slovenia https://orcid.org/0000-0002-1257-5376
DOI:
https://doi.org/10.26493/2590-9770.1747.65cKeywords:
Polycirculant, unit-distance graph, Gray graph, ADAM graph, generalized Petersen graphAbstract
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.
Published
2025-02-21
Issue
Section
The Dragan Marušič Issue of ADAM