Edge-transitive graph Guide, Meaning , Facts, Information and Description

In mathematics, an edge-transitive graph is a graph G such that, given any two edges e₁ and e₂ of G, there is some automorphism

f : G → G

such that

f ( e₁ ) = e₂.

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

See also

• Vertex-transitive graph

This is an Article on Edge-transitive graph. Page Contains Information, Facts Details or Explanation Guide About Edge-transitive graph

	Web www.E-paranoids.com