Learn More
An L(2, 1)-labeling of a graph G is equitable if the number of elements in any two color classes differ by at most one. The equitable L(2, 1)-labeling number λ e (G) of G is the smallest integer k such that G has an equitable L(2, 1)-labeling. Sierpi´nski graphs S(n, k) generalize the Tower of Hanoi graphs — the graph S(n, 3) is isomorphic to the graph of(More)
  • 1