The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


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 ( K1,n ), Coconut Tree, Bistar (Sm,n), the Graph S m n k Comb, (P n K 1) 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.

Keywords

Bistar, Coconut Tree, Comb, Polygonal Sum Labeling, Star, Subdivision Graph.
User