Frequency partition of a graph

In [2], Chinn proved that given any partition p= f₁+f₂+...+f_k of an integer p > 1, other than p = 1+1+1+...+1, there is at least one (connected) graph having this partition as its frequency partition. It is obvious that a graph G and its complementary grah have the same frequency partition. When the degree d_i occurs f_i times, we use the notation d₁f¹