In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself. A simple graph contains no loops. Depending...

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

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

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

Loop quantum gravity (LQG) is a theory of quantum gravity that incorporates matter of the Standard Model into the framework established for the intrinsic...

In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if...

collaborative software Loop (algebra), a quasigroup with an identity element Loop (graph theory), an edge that begins and ends on the same vertex Loop (topology)...

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

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes...

In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during...

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

In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly...

In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G...

mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...

together into an edge. Diagrams with loops (in graph theory, these kinds of loops are called cycles, while the word loop is an edge connecting a vertex with...

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

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether...

In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of...

signal-flow graph theory builds on that of directed graphs (also called digraphs), which includes as well that of oriented graphs. This mathematical theory of...

common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. In graph theory an...

1999). "Simultaneous intersection representation of pairs of graphs". Journal of Graph Theory. 32 (2): 171–190. doi:10.1002/(SICI)1097-0118(199910)32:2<171::AID-JGT7>3...

Stability criterion in control theoryPages displaying short descriptions of redirect targets Signal-flow graph – Flow graph invented by Claude Shannons Stable...

The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective, random graphs are used...

In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential...

mathematics, loop-erased random walk is a model for a random simple path with important applications in combinatorics, physics and quantum field theory. It is...

In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges)...