id: 05858356
dt: j
an: 05858356
au: Jesintha, J.Jeba; Sethuraman, G.
ti: A new class of graceful rooted trees.
so: J. Discrete Math. Sci. Cryptography 11, No. 4, 421-435 (2008).
py: 2008
pu: Taru Publications, New Delhi, Delhi, India
la: EN
cc: 
ut: trees; graceful labeling
ci: Zbl 0331.05021
li: 
ab: Summary: In [“Graph decompositions and G-designs,” Proc. 5th Br. comb.
    Conf., Aberdeen 1975, 53‒72 (1976; Zbl 0331.05021)], {\it J.C.
    Bermond} and {\it D. Sotteau} have shown that all rooted trees in which
    all the vertices at the same distance from the root have the same
    degree (symmetrical trees) are graceful. In this paper we extend this
    result. More precisely, we prove that all rooted trees, in which every
    level contains pendant vertices and the degrees of internal vertices
    within the same level are equal but the degree of internal vertices in
    the different levels could be different, are graceful.
rv: