The M\"obius-Kantor graph is a faithful unit-distance graph
Nino Ba\v{s}i\'c, G\'abor G\'evay, Toma\v{z} Pisanski
TL;DR
This paper proves that the M"obius-Kantor graph can be embedded in the plane with all edges of equal length, providing a faithful unit-distance representation.
Contribution
It is the first demonstration that the generalized Petersen graph GP(8,3) admits a faithful unit-distance embedding in the plane.
Findings
The M"obius-Kantor graph has a faithful unit-distance representation.
This is the first such embedding for GP(8,3).
The result advances understanding of graph embeddings in geometric graph theory.
Abstract
In this paper, it has been shown that the generalized Petersen graph , also known as the M\"obius-Kantor graph, admits a faithful unit-distance representation in the plane.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Interconnection Networks and Systems