International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
Volume 5 - Issue 7 |
Published: May 2013 |
Authors: S. Murugesan, D. Jayaraman, J. Shiama |
![]() |
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
@article{ 10.5120/ijais13-450947, author = { S. Murugesan,D. Jayaraman,J. Shiama }, title = { Centered Triangular Sum Labeling of Graphs }, journal = { International Journal of Applied Information Systems }, year = { 2013 }, volume = { 5 }, number = { 7 }, pages = { 1-4 }, doi = { 10.5120/ijais13-450947 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A S. Murugesan %A D. Jayaraman %A J. Shiama %T Centered Triangular Sum Labeling of Graphs%T %J International Journal of Applied Information Systems %V 5 %N 7 %P 1-4 %R 10.5120/ijais13-450947 %I Foundation of Computer Science (FCS), NY, USA
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.