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 symmetric graphs are compiled in the renowned Foster census.
.svg/30px-Encoder_Disc_(3-Bit).svg.png){kind=small}
Interaction
- This page was last modified 02:19, 8 February 2007 by Wikipedia user David Eppstein. Based on work by Wikipedia user(s) Zaslav, Silverfish, Tomo and YUL89YYZ and Anonymous user(s) of Wikipedia.
- All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity. - About Wikipedia
- Disclaimers