- Cayley graph
Wikipedia foundation.
Cayley graph
Look at other dictionaries:
Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… … Wikipedia
Cayley-Baum — Bethe Gitter für z=3 Ein Bethe Gitter (nach Hans Bethe), auch Cayley Baum (nach Arthur Cayley) genannt, ist ein zusammenhängender, wirbelfreier Graph, bei dem jeder Knoten mit z anderen Knoten verbunden ist (z wird auch Koordinationszahl genannt) … Deutsch 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
Cayley, Arthur — ▪ British mathematician born August 16, 1821, Richmond, Surrey, England died January 26, 1895, Cambridge, Cambridgeshire English mathematician and leader of the British school of pure mathematics that emerged in the 19th century. The interested… … Universalium
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
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Cayley's formula — 2^{2 2}=1 tree with 2 vertices,3^{3 2}=3 trees with 3 vertices and 4^{4 2}=16trees with 4 vertices.In mathematics, Cayley s formula is a result in graph theory named after Arthur Cayley. It states that if n is an integer bigger than 1, the number … Wikipedia
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
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
