Research Article
Some Polygonal Sum Labeling of Paths
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 62 - Issue 5 |
| Published: January 2013 |
| Authors: S. Murugesan, D. Jayaraman, J. Shiama |
10.5120/10078-4692
|
S. Murugesan, D. Jayaraman, J. Shiama . Some Polygonal Sum Labeling of Paths. International Journal of Computer Applications. 62, 5 (January 2013), 30-34. DOI=10.5120/10078-4692
@article{ 10.5120/10078-4692,
author = { S. Murugesan,D. Jayaraman,J. Shiama },
title = { Some Polygonal Sum Labeling of Paths },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 62 },
number = { 5 },
pages = { 30-34 },
doi = { 10.5120/10078-4692 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A S. Murugesan
%A D. Jayaraman
%A J. Shiama
%T Some Polygonal Sum Labeling of Paths%T
%J International Journal of Computer Applications
%V 62
%N 5
%P 30-34
%R 10.5120/10078-4692
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A (p,q) graph G is said to admit a polygonal sum labeling if its vertices can be labeled by non -negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q polygonal numbers. A graph G which admits a polygonal sum labeling is called a polygonal sum graph. In this paper we prove that the paths admit pentagonal, hexagonal, heptagonal, octagonal, nonagonal and decagonal sum labeling. This work is a nice composition of graph theory and combinatorial number theory.
References
- Frank Harary, Graph theory, Narosa Publishing House- (2001).
- D. M. Burton, Elementary number theory, Brown publishers, Second edition(1990)
- J A Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatorics, 17(2010) # DS6
- S. K. Vaidya, U. M. Prajapatti and P. L. Vihol, some Important Results on Triangular sum graphs, Applied Mathematical Sciences, Vol. 3,2009,no. 36,1763-1772
Index Terms
Keywords