TOPICS
Search

Graph Co-Rank


The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, p. 25).


See also

Graph Rank, Rank Polynomial

Explore with Wolfram|Alpha

References

Biggs, N. L. Algebraic Graph Theory, 2nd ed. Cambridge, England: Cambridge University Press, p. 25, 1993.Godsil, C. and Royle, G. Algebraic Graph Theory. New York: Springer-Verlag, 2001.

Referenced on Wolfram|Alpha

Graph Co-Rank

Cite this as:

Weisstein, Eric W. "Graph Co-Rank." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/GraphCo-Rank.html