Lucky labeling of jelly fish graph J(m, n), cocktail party graph CPk and crown graph Cn*
Sateesh Kumar T. V., S. Meenakshi · AIP conference proceedings · 2022
The Lucky labeling graph is the totals of labels over neighbouring nodes in the graph are not the identical, and if a node is an isolated then the sum is zero. The lucky number of G is indicated by η(G). The graphs which admit the above condition are called lucky graph. Here we proved that Jelly fish graph J(m, n), cocktail party graph CPk and crown graph Cn* are lucky graph with their lucky number η(G).