Preferences help
enabled [disable] Abstract
Number of results
2020 | 145 | 85-94
Article title

Oblong Sum Labeling of Union of Some Graphs

Title variants
Languages of publication
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,...} 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 article, the oblong sum labeling of union of some graphs are studied.
Physical description
  • Department of Mathematics, The M.D.T Hindu College, Tirunelveli, India
  • Department of Mathematics, The M.D.T Hindu College, Tirunelveli, India
  • [1] J.C. Berbond, Graceful Graphs, Radio Antennae and French Wind Mills, Graph Theory and Combinatorics. Pitman, London, 1979, 13-37
  • [2] G.S. Bloom and S.W. Golomb, Applications of Numbered Undirected Graphs, Proceedings of IEEE, Vol. 65, No.4, (1977), 562-570
  • [3] G.S. Bloom G.S and Golomb. S.W, Numbered complete Graphs, Unusual Rules and Assoorted Applications, Theory and Applications of Graphs, Lecture Notes in Math 642, Springer- Verlag, 1978, 53-65
  • [4] Chen Zhi-bo, Integral Sum Graphs from Identification. Journal of Discrete Mathematics, 181(1-3) (1998) 77-90
  • [5] S.W. Golomb, How to Number a Graph in Graph theory and Computing, R.C. Read. ed., Academic Press, Newyork (1972), 23-37.
  • [6] F. Harary, Sum Graphs and Difeerence Graphs. Congr. Numeri. 72(1990),101-108
  • [7] F. Harary, Sum Graphs Over All the Integers, Discrete Math. 124 (1994) 99-105S
  • [8] M. Hedge and P. Shankaran, On Triangular Sum Labeling of Graphs in: B.D. Acharya and S. Arumugam, A. Rosa Ed., Labeling of Discrete Structures and Applications, Narosa Publishing House, New Delhi, 2008, 109-115
  • [9] Henning Fernau, Joe F. Ryan, Kiki A. Sugeng, A Sum Labeling for the Generalised Friendship Graph. Discrete Mathematics, 308 (2008) 734-740
  • [10] Joseph A Gallian, A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, 17 (2014) #DS6
  • [11] Muhammed Imran, Adnan Aslam, Sohail Zafar and Waqar Nazeer, Further Results on Edge Irregularity Strength of Graphs. Indonesian Journal of Combinatorics, 1(2), (2017) 82-97
  • [12] K. Murugan, N. Petchiammal and M. Prema, Oblong Sum Labeling – An Introduction, Enrich, VII(I), July-Dec. 2015, 82-90.
  • [13] D. Ramya, R. Kalaiyarasi and P. Jeyanthi, Skolem Odd Difference Mean Graphs, Journal of Algorithms and Computation,45(2014),1-12
  • [14] M. Prema and K. Murugan, Oblong Sum Labeling of Some Special Graphs. World Scientific News, 98 (2018) 12-22
  • [15] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graphs, (International Symposium, Rome, July 1966), Gorden, Breach. N.Y. and Dunad, Paris (1967), 349-355.
  • [16] M.A. Seoud and M.A. Salim, Further Results on Triangular Sum Graphs. International Mathematical Forum, Vol. 7, No. 48 (2002) 2393-2475
  • [17] K. Vaidya, U.M. Prajapati and P.L. Vihol, Some Important Results On Triangular Sum Graphs. Applied Mathematical Sciences, Vol. 3, 2009, No. 36, 1763-1772
  • [18] Yan Yan, Shenggui Zhang, Fang-Xiang, Applications of Graph Theory in Protein Structure Identification, Proceedings of the International Workshop on Computational Proteomics, Hong Kong, China (2010)
  • [19] Zhang Ming, Yu Hong-quan, Mu Hai-lin. Some Results on Sum Graph, Integral Sum Graph and Mod Sum Graph. Journal of Mathematical Research & Exposition, Vol. 28, No. 1, (Feb 2008) 217-222
  • [20] Zhibo Chen, On Integral Sum Graphs. Discrete Mathematics, 306 (2006) 19-25
Document Type
Publication order reference
YADDA identifier
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.