 In general, there are many non-isomorphic graphs with a given frequency partition.A graph and its complement have the same frequency partition.For any partition "p" = "f"1 + "f"2 + ... + "f""k" of an integer "p" > 1, other than "p" = 1 + 1 + 1 + ... + 1, there is at least one (connected) simple graph having this partition as its frequency partition.