Symmetric graph

From Wikipedia, the free encyclopedia

In graph theory a graph is symmetric or arc transitive if it is both vertex transitive and edge transitive. Trivalent or cubic symmetric graphs are compiled in the renowned Foster census.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../s/y/m/Symmetric_graph.html"