A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let be the number of graph edges at each node, the number of graph edges at each node of the dual graph, the number of graph vertices, the number of graph edges, and the number of faces in the Platonic solid corresponding to the given graph. The following table summarizes the completely regular graphs, which are simply equivalent to the Platonic graphs.
Completely Regular Graph
See alsoCompletely Regular Space
Explore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Completely Regular Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CompletelyRegularGraph.html