Cyclomatic number

For the related notion called cycle rank in directed graphs, see cycle rank.

In graph theory, a branch of mathematics, the cyclomatic number, circuit rank, cycle rank, corank or nullity of an undirected graph is the minimum number of edges that must be removed from the graph to break all its cycles, making it into a tree or forest.

The concept was introduced and called the cyclomatic number by Gustav Kirchhoff.

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.