Circuit rank.html



This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. (June 2008)

The circuit rank of a graph G is the minimum number m of edges to remove from the graph to make it cycle-free.

m = e − n + c

where:

• e is the number of edges in G
• n is the number of nodes in G
• c is the number of connected components of G

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.