Rank (graph theory)

In graph theory, a branch of mathematics, the rank of an undirected graph has two unrelated definitions. Let n equal the number of vertices of the graph.

• In the matrix theory of graphs the rank r of an undirected graph is defined as the rank of its adjacency matrix.

Analogously, the nullity of the graph is the nullity of its adjacency matrix, which equals n − r.

• In the matroid theory of graphs the rank of an undirected graph is defined as the number n − c, where c is the number of connected components of the graph. Equivalently, the rank of a graph is the rank of the oriented incidence matrix associated with the graph.^[1]

Analogously, the nullity of the graph is the nullity of its oriented incidence matrix, given by the formula m − n + c, where n and c are as above and m is the number of edges in the graph. The nullity is equal to the first Betti number of the graph. The sum of the rank and the nullity is the number of edges.

Examples

A sample graph and matrix:

An undirected graph.

(corresponding to the four edges, e1–e4):

1 2 3 4 1 0 1 1 1 2 1 0 0 0 3 1 0 0 1 4 1 0 1 0

=

${\displaystyle {\begin{pmatrix}0&1&1&1\\1&0&0&0\\1&0&0&1\\1&0&1&0\\\end{pmatrix}}.}$

In this example, the matrix theory rank of the matrix is 4, because its column vectors are linearly independent.

See also

• Circuit rank
• Cycle rank
• Nullity (graph theory)