The week's pick
Reseach Article
Tetrahedral and Pentatopic Sum Labeling of Graphs
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 5 - Number 6 |
| Year of Publication: 2013 |
| Authors: S. Murugesan, D. Jayaraman, J. Shiama |
10.5120/ijais13-450934
|
S. Murugesan, D. Jayaraman, J. Shiama . Tetrahedral and Pentatopic Sum Labeling of Graphs. International Journal of Applied Information Systems. 5, 6 ( April 2013), 31-35. DOI=10.5120/ijais13-450934
Abstract
A (p; q) graph G is said to admit tetrahedral or pentatopic 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 tetrahedral or pentatope numbers. A graph G which admits tetrahedral or pentatopic sum labeling is called tetrahedral or pentatopic sum graph. In this paper we prove that paths, combs, stars, subdivision of stars and Bm;n admit tetrahedral and pentatopic 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.
Index Terms
Keywords