trivalent graph
Смотреть что такое "trivalent graph" в других словарях:
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph … Wikipedia
Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive … Wikipedia
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Coxeter graph — This article is about the 3 regular graph. For the graph associated with a Coxeter group, see Coxeter diagram. Coxeter graph The Coxeter graph Vertices 28 Edges 42 … Wikipedia
Dyck graph — The Dyck graph Named after W. Dyck Vertices 32 Edges … Wikipedia
Tietze's graph — The Tietze s graph Vertices 12 Edges 18 Diameter … Wikipedia
Foster graph — infobox graph name = Foster graph image caption = namesake = vertices = edges = chromatic number = chromatic index = In graph theory the Foster graph is a graph on 90 vertices and 135 arcs. It is the unique distance transitive graph with… … Wikipedia
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 … Wikipedia
10-cage de Balaban — Représentation de la 10 cage de Balaban Nombre de sommets 70 Nombre d arêtes 105 Rayon 6 Diamètre 6 … Wikipédia en Français
