SUM CORDIAL LABELING OF CORONA PRODUCT GRAPH OF PATH TO PATH

  • Department of Mathematics, Kalinga University, New Raipur, Chhattisgarh-492101, India.
  • Department of Mathematics, Kalinga University, New Raipur, Chhattisgarh-492101, India.
  • Department of Mathematics, St. Josephs College Darjeeling, West Bangal-734101, India.
  • Abstract
  • Keywords
  • Cite This Article as
  • Corresponding Author

In this paper the researcher studies on the labeling of Corona Product Graph of Path to Path by admitting the certain condition of Sum cordial labeling. A sum cordial labeling of a graph      is a binary labeling with vertex set V, with edge labeling f:E(G) {0,1},defined by f(uv)=(f(u)+f(v))(mod2) if |vf(0)-vf(1)|≤1and |ef(0)-ef(1)|≤1. A graph G is Sum cordial if it admits Sum cordial labeling. 



[Dibya Gulab Minj, G.V.V. Jagannadha Rao and Chiranjilal Kujur (2023); SUM CORDIAL LABELING OF CORONA PRODUCT GRAPH OF PATH TO PATH Int. J. of Adv. Res. 11 (Aug). 410-414] (ISSN 2320-5407). www.journalijar.com


Dibya Gulab Minj
Kalinga University
India

DOI:


Article DOI: 10.21474/IJAR01/17405      
DOI URL: https://dx.doi.org/10.21474/IJAR01/17405