Jump to content

Edge-transitive graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 24.2.209.115 (talk) at 20:45, 8 April 2004 (created page by analogy with "Vertex-transitive graph)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Edge-transitive_graph&oldid=3113549"