The Möbius-Kantor graph is a faithful unit-distance graph

2025/08/08 by Nino Bašić, Bašić, Nino, Gábor Gévay +3
Computer Science · Engineering · Mathematics · #05C10 #05C62 #05E18 #20B25 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Interconnection Networks and Systems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2508.06618

openalex publication_date 2025/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, it has been shown that the generalized Petersen graph \mathrm GP(8,3), also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in the plane.

Citations

• The Gray graph is a unit-distance graph
• Two notions of unit distance graphs
• Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations

Related

• Small unit-distance graphs in the plane
• Eleven Unit Distance Embeddings of the Heawood Graph
• The Gray graph is a unit-distance graph
• No finite 5-regular matchstick graph exists
• 1-planar unit distance graphs