Nullity (graph theory)

From Wikipedia, the free encyclopedia

The nullity of a graph is defined as the number

m = b − n + c

where b is the number of edges, n is the number of nodes and c the number of components. Equivalently, the nullity of a graph is the dimension of the null space of the oriented incidence matrix associated with the graph.

[edit] See also

• Rank (graph theory)

[edit] References

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