 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
In mathematics, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is some automorphism
such that
In other words, a graph is edge-transitive if its automorphism group acts transitively upon its edges.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
