The week's pick
Random Articles
Reseach Article
Centered Triangular Sum Labeling of Graphs
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 5 - Number 7 |
| Year of Publication: 2013 |
| Authors: S. Murugesan, D. Jayaraman, J. Shiama |
10.5120/ijais13-450947
|
S. Murugesan, D. Jayaraman, J. Shiama . Centered Triangular Sum Labeling of Graphs. International Journal of Applied Information Systems. 5, 7 ( May 2013), 1-4. DOI=10.5120/ijais13-450947
Abstract
A (p,q) graph G is said to admit centered triangular 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 centered triangular numbers. A graph G which admits centered triangular sum labeling is called centered triangular sum graph. In this paper we prove that paths, combs, stars, subdivision of stars, bistars and coconut trees and admit centered triangular sum labeling.
References
- F. Harary, Graph Theory, Addition-Wesley, Reading, Mass, 1972.
- David M. Burton, Elementary Number Theory, Second Edition,Wm. C. Brown Company Publishers, 1980.
- J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics, 17 (2010), DS6.
- S. M. Hegde and P. Shankaran , On triangular sum labeling of graphs, in Labeling of Discrete Structures and Applications, Narosa Publishing House, New Delhi, 2008, 109- 115. 4
Index Terms
Keywords