Strongly*-2 Divisor Cordial Labeling of Cycle Related Graphs

Authors

  • C. Jayasekaran Department of Mathematics, Pioneer Kumaraswamy College, Nagercoil - 629003, Tamil Nadu, India
  • V.G. Michael Florance Research Scholar, Reg. No: 19223042092019, Department of Mathematics, Pioneer Kumaraswamy College, Nagercoil - 629003, Tamil Nadu, India. Affliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627012, Tamil Nadu, India

DOI:

https://doi.org/10.23755/rm.v48i0.1299

Keywords:

Bijection, Cordial labeling, Strongly*-graph, Strongly*-2 divisor cordial graph.

Abstract

A strongly*-2 divisor cordial labeling of a graph G with the vertex set V (G) is a bijection a : V (G) → {1, 2, 3, ..., |V (G)|} such that each edge cd assigned the label 1 if the lower integal value of sum of a(c), a(d) and a(c)a(d) divided by 2 is odd and 0 if lower integal value of sum of a(c), a(d) and a(c)a(d) divided by 2 is even, then the number of edges labeled with 0 and the number of edges labeled with 1 differs by atmost 1 or |ea(0) − ea(1)| ≤ 1 where ea(0) denotes the number of edges labeled with 0 and ea(1) denotes the number of edges labeled with 1. A graph which admits a strongly*-2 divisor cordial labeling is called a srongly*-2 divisor cordial graph. In this paper, we prove that the wheel graph Wg and sunflower graph SFg are strongly*-2 divisor cordial graphs.

References

D. S. C. Adiga. "Strongly*-graphs." Math. Forum, 13, 1999.

V. M. F. C. Jayasekaran. "Some results on strongly*-2 divisor cordial labeling." Journal of Computer and Mathematics Education, 11(3), 2020.

I. Cahit. "Cordial graphs - a weaker version of harmonious graphs." Ars Combinatoria, 23, 1987.

J. Gallian. "A dynamic survey of graph labeling." Electronic Journal of Combinatorics, DS6, 2018.

F. Harary. "Graph theory." Narosa Publishing House, New Delhi, 1988.

V. V. J. Baskar, K. Kannan. "Vertex strongly*-graphs." Internat. J. Analyzing Components and Combin. Biology in Math., 2, 2009.

A. M. M.A. Seoud. "Necessary conditions for strongly*-graphs." AKCE Internat. J. Graphs Comb., 9(2), 2012.

K. N. R. Varatharajan, S.N. Krishnan. "Divisor cordial graph." International Journal of Mathematical Combinatorics, 4, 2011.

J. V. S.T.A. Mary. "Strongly*-labeling." International Journal of Mathematics Trends and Technology, 63(1), 2018.

Downloads

Published

2023-12-30

Issue

Vol. 48 (2023)

Section

Volume 48-2023

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.