Circuit rank

From Wikipedia, the free encyclopedia

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