In
:"f" : "G" → "G", "g" : "G" → "G"
such that
:"f" (e1) = e2, "g" (e1) = e2
and
:"f" ("u"1) = "u"2, "f" ("v"1) = "v"2, :"g" ("u"1) = "v"2, "g" ("v"1) = "u"2.
In other words, a graph is arc-transitive if its automorphism group acts transitively upon its arcs.
Wikimedia Foundation. 2010.
Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group … Wikipedia
Edge-transitive graph — In mathematics, an edge transitive graph is a graph G such that, given any two edges e 1 and e 2 of G , there is an automorphism of G that maps e 1 to e 2.In other words, a graph is edge transitive if its automorphism group acts transitively upon … Wikipedia
Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive … Wikipedia
Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Algebraic graph theory — is a branch of mathematics in which algebraic methods are applied to problems about graphs. In one sense, algebraic graph theory studies graphs in connection with linear algebra. Especially, it studies the spectrum of the adjacency matrix, the… … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Holt graph — In the Holt graph, all vertices are equivalent, and all edges are equivalent, but edges are not necessarily equivalent to their inverses. Named after Derek F. Holt Vertices 27 … Wikipedia
Clebsch graph — Named after Alfred Clebsch Vertices 16 Edges 40 … Wikipedia
Kneser graph — infobox graph name = Kneser graph image caption = The Kneser graph KG 5,2, isomorphic to the Petersen graph namesake = Martin Kneser properties = arc transitiveIn graph theory, the Kneser graph KG {n,k} is the graph whose vertices correspond to… … Wikipedia
