Edge-transitive graph

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 its edges.

Examples and properties

* Any complete bipartite graph K_{m,n} is edge-transitive.
* Any edge-transitive graph that is not vertex-transitive is bipartite. These graphs are called semi-symmetric.

See also

* Vertex-transitive graph
* Arc-transitive graph
* Edge-transitive (in geometry)

External links

*


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • 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

  • 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

  • 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

  • Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… …   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

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

  • Edge contraction — In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging together the two vertices it previously connected. Edge contraction is a fundamental operation in the theory of graph minors.… …   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

  • 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

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”