Computing Assortative Mixing by Degree with the -Metric in Networks Using Linear Programming

Figure 2

Graphs that have maximal value ((a) and (b)) and minimal values ((c) and (d)) for the graphs and corresponding to the ones in Figure 1. Degrees are inside the nodes.

(a)

(b)

(c)

(d)