Halved cube graphIn graph theory, the halved cube graph or half cube graph of dimension n is the vertex-edge graph of the demihypercube, formed by connecting pairs of vertices at distance exactly…View analysis →
Threshold graphIn graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations:View analysis →
Regular graphIn graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must…View analysis →
Block graphIn graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique.View analysis →
Trapezoid graphIn graph theory, trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. They are a class of co-comparability graphs that contain interval graphs and…View analysis →
Folded cube graphIn graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects opposite pairs of hypercube vertices.View analysis →
Hamming graphHamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science. Let S be a set of q…View analysis →
Laman graphIn graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n…View analysis →
Gary ChartrandGary Theodore Chartrand (born 24 August 1936) is an American-born mathematician who specializes in graph theory. He is known for his textbooks on introductory graph theory and…View analysis →
Graph labelingIn the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph.View analysis →
Induced pathIn the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices in G such…View analysis →
Ptolemaic graphIn graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek astronomer and…View analysis →
Half graphIn graph theory, a branch of mathematics, a half graph is a special type of bipartite graph. These graphs are called the half graphs because they have approximately half of the…View analysis →
Tutte graphIn the mathematical field of graph theory, the Tutte graph is a 3-regular graph with 46 vertices and 69 edges named after W. T. Tutte. It has chromatic number 3, chromatic index…View analysis →
Connected dominating setIn graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.View analysis →
Windmill graphIn the mathematical field of graph theory, the windmill graph Wd(k,n) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a…View analysis →
Self-complementary graphIn the mathematical field of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the…View analysis →
Graph coloringIn graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain constraints, such as…View analysis →
Matching (graph theory)In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of…View analysis →
Signed graphIn the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.View analysis →
Crown graphIn graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices {u1, u2, …, un} and {v1, v2, …, vn} and with an edge from…View analysis →
Cycle (graph theory)In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail…View analysis →
CutwidthIn graph theory, the cutwidth of an undirected graph is the smallest integer k {\displaystyle k} with the following property: there is an ordering of the vertices of the graph…View analysis →
Graph traversalIn computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals are…View analysis →
Star (graph theory)In graph theory, the star Sk is the complete bipartite graph K1, k, that is, it is a tree with one internal node and k leaves. Alternatively, some authors define Sk to be the…View analysis →
Geometric graph theoryGeometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric…View analysis →
