[1] [2] The meshedness coefficient is used to compare the general cycle structure of a connected planar graph to two extreme relevant references.
[1] The other extreme is represented by maximal planar graphs, planar graphs with the highest possible number of edges and faces for a given number of vertices.
This ratio is 0 for a tree and 1 for any maximal planar graph.
Therefore, a normalized meshedness coefficient can be defined as the ratio of these two numbers: It varies from 0 for trees to 1 for maximal planar graphs.
[3] It has also been used to characterize the network structure of streets in urban areas.