International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 72 - Issue 10 |
Published: June 2013 |
Authors: S. Murugesan, D. Jayaraman, J. Shiama |
![]() |
S. Murugesan, D. Jayaraman, J. Shiama . Some Higher Order Triangular Sum Labeling of Graphs. International Journal of Computer Applications. 72, 10 (June 2013), 1-8. DOI=10.5120/12527-8986
@article{ 10.5120/12527-8986, author = { S. Murugesan,D. Jayaraman,J. Shiama }, title = { Some Higher Order Triangular Sum Labeling of Graphs }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 72 }, number = { 10 }, pages = { 1-8 }, doi = { 10.5120/12527-8986 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A S. Murugesan %A D. Jayaraman %A J. Shiama %T Some Higher Order Triangular Sum Labeling of Graphs%T %J International Journal of Computer Applications %V 72 %N 10 %P 1-8 %R 10.5120/12527-8986 %I Foundation of Computer Science (FCS), NY, USA
A (p,q) graph G is said to admit nth order 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 nth order triangular numbers. A graph G which admits nth order triangular sum labeling is called nth order triangular sum graph. In this paper we prove that paths, combs, stars, subdivision of stars, bistars and coconut trees admit fourth, fifth and sixth order triangular sum labelings.