Editing Cyclomatic number (section)

===Meshedness coefficient===
A variant of the cyclomatic number for [[planar graph]]s, normalized by dividing by the maximum possible cyclomatic number of any planar graph with the same vertex set, is called the [[meshedness coefficient]]. For a connected planar graph with {{mvar|m}} edges and {{mvar|n}} vertices, the meshedness coefficient can be computed by the formula<ref>{{citation
 | last1 = Buhl | first1 = J.
 | last2 = Gautrais | first2 = J.
 | last3 = Sole | first3 = R.V.
 | last4 = Kuntz | first4 = P.
 | last5 = Valverde | first5 = S.
 | last6 = Deneubourg | first6 = J.L.
 | last7 = Theraulaz | first7 = G.
 | doi = 10.1140/epjb/e2004-00364-9
 | issue = 1
 | journal = The European Physical Journal B
 | pages = 123–129
 | publisher = Springer-Verlag
 | title = Efficiency and robustness in ant networks of galleries
 | volume = 42
 | year = 2004| bibcode = 2004EPJB...42..123B
 }}.</ref>
:<math>\frac{m-n+1}{2n-5}.</math>
Here, the numerator <math>m-n+1</math> of the formula is the cyclomatic number of the given graph, and the denominator <math>2n-5</math> is the largest possible cyclomatic number of an {{mvar|n}}-vertex planar graph. The meshedness coefficient ranges between 0 for trees and 1 for [[maximal planar graph]]s.