of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph...

In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first...

clique of a graph G {\displaystyle G} is an induced subgraph of G {\displaystyle G} that is complete. Cliques are one of the basic concepts of graph theory...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some...

determining whether two finite graphs are isomorphic. The problem is not known to be solvable in polynomial time nor to be NP-complete, and therefore may be in...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed...

related to Cycle graphs. Complete bipartite graph Complete graph Circulant graph Cycle graph (algebra) Null graph Path graph Some simple graph spectra. win...

field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is...

In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing. Outerplanar...

graphs through their alternative constructions: rook's graphs are the Cartesian product of two complete graphs, and are the line graphs of complete bipartite...

first complete proof of this latter claim was published posthumously in 1873 by Carl Hierholzer. This is known as Euler's Theorem: A connected graph has...

orientation of an undirected complete graph. (However, as directed graphs, tournaments are not complete: complete directed graphs have two edges, in both directions...

of graph minors began with Wagner's theorem that a graph is planar if and only if its minors include neither the complete graph K5 nor the complete bipartite...

mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that...

is, to generate the complement of a graph, one fills in all the missing edges required to form a complete graph, and removes all the edges that were...

Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...

bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...

problems of determining whether such paths and cycles exist in graphs are NP-complete; see Hamiltonian path problem for details. Hamiltonian paths and...

In graph theory, the hypercube graph Qn is the edge graph of the n-dimensional hypercube, that is, it is the graph formed from the vertices and edges...

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...

Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...

degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of the degree of the graph. A complete graph (denoted K n {\displaystyle...

In graph theory, a critical graph is an undirected graph all of whose proper subgraphs have smaller chromatic number. In such a graph, every vertex or...

{\displaystyle K_{6}} (the complete graph with 6 vertices) on a real projective plane. With this embedding, the dual graph is the Petersen graph --- see hemi-dodecahedron...

In 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...