Popular Searches
is edge
Edge-transitive graph
In mathematics, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an
automorphism of G that maps e1 to e2.
In other words, a graph is edge-transitive if its automorphism group acts transitively upon its edges.
Examples and properties
- Any complete bipartite graph is edge-transitive.
- Any edge-transitive graph that is not vertex-transitive is bipartite. These graphs are called semi-symmetric.
See also
- Vertex-transitive graph
- Arc-transitive graph
- Edge-transitive (in geometry)
External links
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Sunday July 27, 2008 at 13:54:32 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
This article is licensed under the GNU Free Documentation License.
Last updated on Sunday July 27, 2008 at 13:54:32 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
Related Articles
|
|
|
|
|
|
|
|
|
|
|
HighBeam Research, Inc. © Copyright 2009.
Copyright © 2013 Dictionary.com, LLC. All rights reserved.
