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 some automorphism
- f : G → G
such that
- f ( e1 ) = 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 <math>K_{m,n}<math> is edge-transitive.
- Any edge-transitive graph that is not vertex-transitive is bipartite.