Completely Regular Graph

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of graph edges at each node of the dual graph, V the number of graph vertices, E the number of graph edges, and F 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.

See also

Completely Regular Space

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Completely Regular Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications