Edge-transitive graph
Graph where all pairs of edges are automorphic / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Edge-transitive graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about graph theory. For edge transitivity in geometry, see Edge-transitive.
In the mathematical field of graph theory, 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.[1]
Quick Facts Graph families defined by their automorphisms, → ...
Close
In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.