PL EN


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

Extra Skolem Difference Mean Labeling of Some Graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x ϵ V with distinct elements f (x) from the set {1,2…p+q} in such a way that the edge e =uv is labeled with |f(u)-f(v)|/2 if |f(u)-f(v)| is even and (|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd and the resulting labels of the edges are distinct and are from {1,2…q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. If one of the skolem difference mean labeling of G satisfies the condition that all the labels of the vertices are odd, then we call this skolem difference mean labeling an extra skolem difference mean labeling and call the graph G an extra skolem difference mean graph. In this paper, extra skolem difference mean labeling of some graphs are studied.
Year
Volume
145
Pages
210-221
Physical description
Contributors
  • P.G. & Research Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, India
author
  • P.G. & Research Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, India
References
  • [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] 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] Dharamvirsingh Parmar, Urvisha Vaghela, Skolem Difference Mean Labeling of Some Path Related Graphs, Pramana Research Journal, Vol. 9, Issue 5, 2019, 651-657
  • [5] Gee-Choon Lau, P. Jeyanthi, D. Ramya, R. Kalaiyarasi, On Skolem Odd and Even Difference Mean Graphs. Journal of King Saud University - Science 30 (2018) 286-291
  • [6] S.W. Golomb, How to Number a Graph in Graph theory and Computing, R.C. Read. Ed., Academic Press, New York (1972), 23-37.
  • [7] Joseph A Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 15, 2008, DS6
  • [8] P. Jeyanthi, D. Ramya, R. Kalaiyarasi. Skolem Odd Difference Mean Graphs. Journal of Algorithms and Computation, Vol. 45, Issue 1, (2014) 1-12
  • [9] P. Jeyanthi, M. Selvi , D. Ramya, Skolem Difference Mean Labeling of Disconnected Graphs. Proyecciones Journal of Mathematics, Vol. 36, No. 2, June 2017, 347-361
  • [10] S. Mari Selvi, K. Murugan, Generating Skolem Difference Mean Graphs. World Scientific News 126 (2019) 11-22
  • [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 and A. Subramanian, Skolem Difference Mean Labeling of H-graphs. International Journal of Mathematics and Soft Computing, Vol. 1 No. 1, 2011, 115-129
  • [13] K. Murugan, Edge Reduced Skolem Difference Mean Number of Some Graphs. World Scientific News 30 (2016) 129-142
  • [14] A. Ponmani, S. Navaneetha Krishnan, A. Nagarajan, Skolem Difference Lucas Mean Labeling for Some Star Related Graphs. International Journal of Mathematics Trends and Technology, Vol. 62, No. 2, October 2018, 104-109
  • [15] D. Ramya, M. Selvi and R. Kalaiyarasi, On Skolem Difference Mean Labeling of Graphs. International Journal of Mathematical Archive, 4(12), 2013, 73-79
  • [16] 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.
  • [17] M. Selvi and D. Ramya, On Skolem Difference Mean Labeling of Some Trees. International Journal of Mathematics and Soft Computing, Vol. 4, No. 2, 2014, 11-18
  • [18] M. Selvi, D. Ramya and P. Jeyanthi, Skolem Difference Mean Graphs. Proyecciones Journal of Mathematics, Vol. 34, No. 34, September 2015, 243-254
  • [19] S. Shenbaga Devi, A. Nagarajan, Near Skolem Difference Mean Labeling of Special Class of Graphs. IAETSD Journal for Advanced Research in Applied Sciences, Vol. 5, Issue 2, Feb. 2018, 896-900
  • [20] R. Vasuli, J. Venkateswari, G. Pooranam, Skolem Difference Odd Mean Labeling for Some Simple Graphs. International J. Math. Combin. Vol. 3, 2015, 88-98
  • [21] P. Vijaya Kumar, K. Thulukkanam, K. Thirusangu, Skolem Difference Mean Labeling in Duplicate Graphs of Some Path Related Graphs. South East Asian J. of Math. & Math. Sci. Vol. 14, No. 3, 2018, 63-78
  • [22] 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).
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-c72ba044-e50f-49ff-8734-0db90ff1adf4
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.