Strongly*-2 Divisor Cordial Labeling of Cycle Related Graphs

C. Jayasekaran, V.G. Michael Florance


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.


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

Full Text:



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.



  • There are currently no refbacks.

Copyright (c) 2023 C. Jayasekaran, V.G. Michael Florance

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.