On Triangular Sum Labeling of Graphs
Shankaran P, NMAM Institute of Technology
Triangular Numbers, Triangular Sum Labeling/Graphs, Dutch Windmill, Locally Finite Tree
Let G = (V,E) be a (p, q)-graph. A graph G is said to admit a triangular sum labeling, if its vertices can be labeled by non-negative integers so that the values on the edges, obtained as the sum of the labels of their end vertices, are the first q triangular numbers. In this paper, we obtain a necessary condition for an eulerian graph to admit a triangular sum labeling and show that some classes of graphs admit a triangular sum labeling. Also we show that some classes of graphs can be embedded as an induced subgraph of a triangular sum graph.
-
[1] David. M. Burton, Elementary Number Theory, Brown Publishers, Second Edition (1990).
[2] J.A.Gallian, A Dynamic Survey of Graph Labeling, the Electronic Journal of Combinatorics 17#DS 6 (2014).
[3] F. Harary, Graph Theory, Addison Wesley, Reading MA (1969).
[4] P.J. Slater, on k-graceful, countably infinite graphs, Research Report No. 47, (1982).
[5] M.E.Bascunan et. al, On the Additive Bandwidth of Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 18, pp.129-144,(1995).
[6] B.D.Acharya and S.M.Hegde, Arithmetic Graphs, Journal of Graph Theory, Vol. 14(3), pp.275-299, (1990).
[7] B.D.Acharya and S.M.Hegde, Strongly Indexable Graphs, Discrete Mathematics, 93, pp.123-129,(1991).
[8] B.D.Acharya and S.M.Hegde, On Indexable Graphs, Journal of Combinatorics, Information and System Sciences, Vol. 17, Nos. 3-4, pp.316-331,(1992).
[9] S.M.Hegde, On (k,d) Graceful Graphs, Journal of Combinatorics, Information and System Sciences, Vol. 25, Nos. 1-4, pp. 255-265,(2000).
[10] D.B. West, Introduction to Graph Theory, Second Edition, Prentice Hall (2001).
Paper ID: GRDJEV03I070066
Published in: Volume : 3, Issue : 7
Publication Date: 2018-07-01
Page(s): 29 - 33
Published in: Volume : 3, Issue : 7
Publication Date: 2018-07-01
Page(s): 29 - 33