PL EN


Preferences help
enabled [disable] Abstract
Number of results
2019 | 126 | 11-22
Article title

Generating Skolem Difference Mean 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 {1,2,….,p+q} in such a way that the edge e = uv is labeledwith |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 edges get distinct labels from {1,2,…,q}. A graph that admits skolem difference mean labeling is called a Skolem difference mean graph A graph G = (V, E) with p vertices and q edges is said to have Near skolem difference mean labeling if it is possible to label the vertices x  V with distinct elements f(x) from {1,2,….,p+q-1,p+q+2} in such a way that each edge e = uv, is labeled as f*(e) = |f(u)-f(v)|/2 if |f(u)-f(v)| is even and f*(e) =(|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd. The resulting labels of the edges are distinct and from {1,2,…,q}. A graph that admits a Near skolem difference mean labeling is called a Near Skolem difference mean graph. In this paper, the authors generate skolem difference mean graphs from near skolem difference mean graphs.
Year
Volume
126
Pages
11-22
Physical description
Contributors
author
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli – 627010, Tamil Nadu, India
author
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli – 627010, Tamil Nadu, India
References
  • [1] M. Apostal, Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition (1991).
  • [2] Frank Harary, Graph Theory, Narosa Publishing House, New Delhi (2001).
  • [3] Gee-Choou Lau, P. Jeyanthi, D. Ramya and R. Kalaiyarasi, On Skolem Odd and Even Difference Mean Graphs. Journal of King Saud University - Science, Vol. 30, Issue 2, (April 2018), 286-291S
  • [4] W. Golumb, How to number a graph in Graph Theory and Computers, R.C. Read, edition, Academic Press New York (1972), 23-37
  • [5] P. Jeyanthi, R. Kalaiyarasi, D. Ramya and T. Saratha Devi, Some Results on Skolem Odd Difference Mean Graphs. Proyecciones Journal of Mathematics, Vol. 35, No. 4, (December 2016), 05-415
  • [6] P. Jeyanthi, M. Selvi and D. Ramya, Skolem Difference Mean Labeling of Disconnected Graphs. Proyecciones Journal of Mathematics, Vol. 36, No. 2, (June 2017), 347-361
  • [7] Joseph A. Gallian, A Dynamic survey of Graph Labeling. The Electronic Journal of Combinatories, 15 (2008) #D56
  • [8] N. Lakshmi Prasanna, Applications of Graph Labeling in Commuication Networks. Oriental Journal of Computer Science and Technology, Vol. 7, No.1, (April 2014), 139-145
  • [9] L. Meenakshi Sundaram and A. Nagarajan, Skolem Differenec Fibonacci Mean Labeling of Some Special Class of Graphs. International Journal of Mathematics Trends and Technology, Vol. 39, No. 2, (November 2016) 88-93
  • [10] K. Murugan and A. Subramanian, Skolem Difference Mean Labeling of H-graphs. International Journal of Mathematics and Soft Computing, Vol. I, No. 1 (August 2011), 115-129
  • [11] D. Ramya, R. Kalaiyarasi and P. Jeyanthi, Skolem Odd Difference Mean Graphs. Journal of Algorithms and Computations, 45 (2014), 1-12
  • [12] D. Ramya, M. Selvi and R. Kalaiyarasi, On Skolem Difference Mean Labeling of Graphs. International Journal of Mathematical Archive, 4(12) (2013) 73-79
  • [13] A. Rosa, On Certain Valuations of the vertices of a graph, Theory of graphs (International Symposium, Rome, July 1966), Gorden and Breach, N.Y. and Dunod Paris, (1967), 349-355
  • [14] 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
  • [15] S. Shenbagadevi and A. Nagarajan, Near Skolem Difference Mean Labeling of Special Types of Trees. International Journal of Mathematics Trends and Technology, Vol. 52, No. 7 (Dec. 2017) 474-478
  • [16] S. Shenbagadevi and A. Nagarajan, On duplication of Near skolem difference mean graph Pn, International Journal of Statistics and Applied Mathematics, 3(2) (2018) 93-100
  • [17] A. Ponmani, S. Navaneetha Krishnan, and A. Nagarajan, Skolem Difference Lucas Mean Labeling for Star Related Graphs. International Journal of Mathematics Trends and Technology, Vol. 62, No. 2, (October 2018) 104-109
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-c62a259b-687e-4ff9-8772-f2168641f97e
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.