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.
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.
Source: Wikipedia "Cyclomatic number" · CC BY-SA 4.0
Share this article: X · Bluesky