Relevant topics on |
Graph connectivity |
---|
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.
A sample graph and matrix:
(corresponding to the four edges, e1–e4):
|
= |
|
In this example, the matrix theory rank of the matrix is 4, because its column vectors are linearly independent.
Relevant topics on |
Graph connectivity |
---|
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.
A sample graph and matrix:
(corresponding to the four edges, e1–e4):
|
= |
|
In this example, the matrix theory rank of the matrix is 4, because its column vectors are linearly independent.