Top Qs
Timeline
Chat
Perspective
Robertson–Wegner graph
5-regular undirected graph with 30 vertices and 75 edges From Wikipedia, the free encyclopedia
Remove ads
In the mathematical field of graph theory, the Robertson–Wegner graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Neil Robertson and Gerd Wegner.[2][3][4]
It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Meringer graph, and the Wong graph.
It has chromatic number 4, diameter 3, and is 5-vertex-connected.
Remove ads
Algebraic properties
Summarize
Perspective
The characteristic polynomial of the Robertson–Wegner graph is
Remove ads
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads