Oblong sum labeling of some special graphs

• Authors: M. Prema , K. Murugan
• Languages of publication: EN

Abstracts

EN

Numbers of the form n(n+1) are called oblong numbers. Let O_n be the n^th oblong number. An oblong sum labeling of a graph G =(V,E) with p vertices and q edges is a one to one function f : V(G)→{0,2,4,6,8,…} that induces a bijection f^*: E(G)→{O_1,O_2,O_3,…,O_q } of the edges of G defined by f^* (uv)=f(u)+f(v) for all e = uv ∈ E(G). The graph that admits oblong sum labeling is called oblong sum graph. In this paper, oblong sum labeling of some special graphs is studied.

Keywords

EN

Star; oblong numbers; oblong sum labeling

Discipline

• PHYSICS: PHYSICS

• Journal: World Scientific News
• Year: 2018
• Volume: 98
• Pages: 12-22

Contributors

author

M. Prema

• P.G. & Research Department of Mathematics, The M.D.T. Hindu College, Tirunelveli Affiliated to Manonmaniam Sundaranar University Abishekapatti, Tiruneveli, Tamil Nadu 627012, India

author

K. Murugan

• P.G. & Research Department of Mathematics, The M.D.T. Hindu College, Tirunelveli Affiliated to Manonmaniam Sundaranar University Abishekapatti, Tiruneveli, Tamil Nadu 627012, India

References

• [1] J. C. Bermond, Graceful graphs, Radio antennae and French wind mills, Graph Theory and Combinatorics, Pitman, London, 1979, pp. 13-37.
• [2] G. S. Bloom and S. W. Golomb, Applications of numbered undirected graphs, Proceedings of the IEEE, Vol. 65, No. 4, (1977) 562-570
• [3] Frank Harary, Graph Theory, Narosa Publishing House, New Delhi (2001)
• [4] Joseph A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, 15 (2008), #DS6
• [5] M. Selvi, D. Ramya and P. Jeyanthi, Skolem difference mean graphs, Proyecciones Journal of Mathematics, Vol. 34, No.3, (Sep. 2015), 243-254

• Document Type: article