Graph excess
= Graph excess
{title2=$\operatorname{exc}(G)=|E(G)|-|V(G)|$}
Here excess means edges minus vertices. For a <connected graph> it is one less than the number of independent cycles. Deleting a leaf and its incident edge, or suppressing a degree-two vertex, preserves excess. This convention differs by one from the cyclomatic number for connected graphs.