complete graph
51Dense graph — In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a sparse graph. The distinction between sparse and dense graphs is rather vague, and… …
52Unit disk graph — In geometric graph theory, a unit disk graph is the intersection graph of a family of unit circles in the Euclidean plane. That is, we form a vertex for each circle, and connect two vertices by an edge whenever the corresponding circles cross… …
53Cage (graph theory) — In the mathematical area of graph theory, a cage is a regular graph that has as few vertices as possible for its girth.Formally, an ( r , g ) graph is defined to be a graph in which each vertex has exactly r neighbors, and in which the shortest… …
54Wheel graph — infobox graph name = Wheel graph image caption = Several examples of wheel graphs vertices = n edges = 2( n − 1) chromatic number = 3 if n is odd 4 if n is even chromatic index = In the mathematical discipline of graph theory, a wheel graph W n… …
55Cactus graph — A cactus graph (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge in such a graph may belong to at most one cycle.Cactus graphs were first studied under …
56Erdős-Diophantine graph — In Diophantine geometry, an Erdős Diophantine graph, named after Paul Erdős and Diophantus of Alexandria, is a complete graph with vertices located on the integer square grid scriptstylemathbb{Z}^2 such that all mutual distances between the… …
57Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… …
58Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …
59Kneser 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… …
60Coxeter 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 …
