Search Results for ""

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.

A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.

There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

An unordered pair representation is a representation of an undirected graph in which edges are specified as unordered pairs of vertex indices. The unordered pairs ...

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...