More Results on Polygonal Sum Labeling of Graphs

Objectives: To explore and identify some new classes of graphs which exhibit polygonal sum labeling. Methods: In this article we use a methodology which fundamentally involves formulation and subsequent mathematical validation. Findings: Here we establish that the graphs – Star ( K_1,n ), Coconut Tree, Bistar (S_m,n), the Graph S _{m n k} Comb, (P _n K ₁) and Subdivision graph S(K _1,n) admit pentagonal, hexagonal, heptagonal, octagonal, nonagonal and decagonal sum labeling. Applications: One can explore to generalize these results and extend to give n-gonal labeling to some classes graphs. Sum labeling has already been used in the problems involving relational database management and hence one can try out to use polygonal sum labeling as well in these problems.