Symmetric graph


Symmetric graph

In graph theory a graph is symmetric or arc transitive if it is both vertex transitive and edge transitive. Trivalent symmetric graphs are compiled in the renowned Foster census.


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Skew-symmetric graph — In graph theory, a branch of mathematics, a skew symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by reversing all of its edges. The isomorphism is required to be an involution without any fixed… …   Wikipedia

  • Semi-symmetric graph — In mathematics, a semi symmetric graph is an undirected graph that is edge transitive and regular, but not vertex transitive.In other words, a graph is semi symmetric if each vertex has the same number of incident edges, and there is a symmetry… …   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 coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   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

  • Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 …   Wikipedia

  • Symmetric Turing machine — Definition of symmetric Turing machines: SL was first defined in 1982 by Lewis and Papadimitriou, [Jesper Jansson. [http://www.df.lth.se/ jj/Publications/STCON2.ps Deterministic Space Bounded Graph Connectivity Algorithms] . Manuscript. 1998.]… …   Wikipedia

  • Symmetric difference — Venn diagram of The symmetric difference is the union without the intersection …   Wikipedia

  • Symmetric hypergraph theorem — The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore [R …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia


Share the article and excerpts

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

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.