|
|
|
|
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

Discussion
Ask a question about 'Edge-transitive graph'
Start a new discussion about 'Edge-transitive graph'
Answer questions from other users
|
Encyclopedia
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
See also
External links
|
| |
|
|