Edge-transitive Graph

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.

In other words, a graph is edge-transitive if its automorphism group acts transitively upon its edges.

Read more about Edge-transitive Graph:  Examples and Properties

Famous quotes containing the word graph:

    “When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
    —Marshall McLuhan (1911–1980)