1 research outputs found

    Some New Graceful Generalized Classes of Diameter Six Trees

    Full text link
    Here we denote a {\it diameter six tree} by (c;a1,a2,,am;b1,b2,,bn;c1,c2,,cr)(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r}), where cc is the center of the tree; ai,i=1,2,,ma_{i}, i = 1, 2, \ldots, m, bj,j=1,2,,nb_{j}, j = 1, 2, \ldots, n, and ck,k=1,2,,rc_{k}, k = 1, 2, \ldots, r are the vertices of the tree adjacent to cc; each aia_{i} is the center of a diameter four tree, each bjb_{j} is the center of a star, and each ckc_{k} is a pendant vertex. Here we give graceful labelings to some new classes of diameter six trees (c;a1,a2,,am;b1,b2,,bn;c1,c2,,cr)(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r}) in which a diameter four tree may contain any combination of branches with the total number of branches odd though with some conditions on the number of odd, even, and pendant branches. Here by a branch we mean a star, i.e. we call a star an odd branch if its center has an odd degree, an even branch if its center has an even degree, and a pendant branch if it is a pendant vertex
    corecore