Research Article

Some Higher Order Triangular Sum Labeling of Graphs

by  S. Murugesan, D. Jayaraman, J. Shiama
journal cover
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
10.5120/12527-8986
PDF

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
Abstract

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.

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.
  • S. Murugesan, D. Jayaraman and J. Shiama, Second and Third order triangular sum labeling of graphs, International Journal of Mathematical Archive-4(2), Feb-2013, 55-62, ISSN 2229-5046.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Fourth fifth sixth order triangular numbers fourth fifth sixth order triangular sum labelings

Powered by PhDFocusTM