abstract:In graph-theoretic mathematics, the circuit rank, cyclomatic number, or nullity of an undirected graph G is the minimum number r of edges to remove from G to remove all its cycles, making it into a forest. Unlike the corresponding feedback arc set problem for directed graphs, it is easily computed, using the simple formula