Frequency Partitions of Eulerian Graphs
For a frequency partition p = f1 + f2 + ... + fk 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 fi ≥ fj for i < j. Bhat-Nayak et al. (1979) showed that a partition of p with k parts, k ≤ integral part of is a frequency partition of a Eulerian graph and conversely.
Read more about this topic: Frequency Partition Of A Graph
Famous quotes containing the words frequency and/or partitions:
“The frequency of personal questions grows in direct proportion to your increasing girth. . . . No one would ask a man such a personally invasive question as “Is your wife having natural childbirth or is she planning to be knocked out?” But someone might ask that of you. No matter how much you wish for privacy, your pregnancy is a public event to which everyone feels invited.”
—Jean Marzollo (20th century)
“Walls have cracks and partitions ears.”
—Chinese proverb.