Rank (graph theory)

From Wikipedia, the free encyclopedia

The rank of a graph is defined as the number

r = n − c

where n is the number of nodes and c the number of components. Equivalently, the rank of a graph is the rank of the oriented incidence matrix associated with the graph.

[edit] See also

• Nullity (graph theory)

[edit] References

• Chen, Wai-Kai. Applied Graph Theory. North Holland Publishing Company, 1976.