Metrics for Comparisons
Average node degree: It’s just 2m/n
Diameter: length of longest shortest-path between any two nodes
Hop-diameter: Diameter when length = hop count
Length-diameter: Diameter when length = Euclidean length
Hop-length-diameter: Composite metric. Shortest paths are determined using hop count and evaluated using Euclidean-length.
Number of biconnected components (BCC): A BCC is a maximal set of edges such that any two edges are in a common cycle. It’s measurement of the “connectedness” of the graph
Others: there are application-specific metrics such as packet-hop ratio, and delay ratio.