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

Figure 4

The graph from Example 4 in (a) and the polytope in (b) obtained from the degree constraints, and the polyhedron in (c) from only the cutset including the bound 1 constraints. The degree constraints in (b) show that their intersection at is the only possible solution here. The line in (b) indicates where the faces induced by the constraints and intersect.

(a)

(b)

(c)