 Frequency partitions of various graph families are completely identifieds; frequency partitions of many families of graphs are not identified.For a frequency partition "p" = "f"1 + "f"2 + ... + "f""k" of an integer "p" > 1, its graphic degree sequence is denoted as ((d1)f1,(d2)f2, (d3)f3, ..., (dk) fk) where degrees di's are different and "f"i ≥ "f"j for "i" .Also in Lecture Notes in Mathematics, Combinatorics and Graph Theory, Springer-Verlag, New York, Vol.