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.
- Failed to parse (Missing texvc executable; please see math/README to configure.): 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
Image:Encoder Disc (3-Bit).svg This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
