Nauru graph
24-vertex symmetric bipartite cubic graph / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Nauru graph?
Summarize this article for a 10 year old
In the mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David Eppstein after the twelve-pointed star in the flag of Nauru.[1]
It has chromatic number 2, chromatic index 3, diameter 4, radius 4 and girth 6.[2] It is also a 3-vertex-connected and 3-edge-connected graph. It has book thickness 3 and queue number 2.[3]
The Nauru graph requires at least eight crossings in any drawing of it in the plane. It is one of three non-isomorphic graphs tied for being the smallest cubic graph that requires eight crossings. Another of these three graphs is the McGee graph, also known as the (3-7)-cage.[4][5]