Editing Cyclomatic number (section)

==Related concepts==
Other numbers defined in terms of deleting things from graphs are:

* [[Edge connectivity]] - the minimum number of edges to delete in order to disconnect the graph;
* [[Matching preclusion]] - the minimum number of edges to delete in order to prevent the existence of a [[perfect matching]];
*[[Feedback vertex set]] number - the minimum number of vertices to delete in order to make the graph acyclic;
*[[Feedback arc set]] - the minimum number of arcs to delete from a directed graph, in order to make it acyclic.