A NOTE ON α-LABELINGS OF 2k-SUN GRAPHS
Let k be a positive integer. A k-sun graph (or 1-crown graph of order k) is a graph obtained from a k-cycle by adding a pendent edge to each vertex of the k-cycle. A graceful labeling of can be viewed as a copy Lof with vertices in the set of integers such that for any non-zero element d of this set there is an edge of L with is said to be an α-labeling if L is bipartite and all vertices of one part of Lare smaller than any vertex of the other part. Moreover, an α-labeling of is called -labeling of if whose largest label vertex has degree 1. In this note, we give an -labeling of As its corollaries, we obtain that there exist a cyclic 2k-sun system of order vfor and a 1-rotational 2k-sun system of order v for
α-labeling, sun graph, cyclic, 1-rotational.