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 Node_(graph_theory)s in G
• c is the number of Connected_component_(graph_theory)s of G