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.
36 Downloads
126 Views
Abstract
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.
Keywords
How to Cite This Article
Dibya Gulab Minj, G.V.V. Jagannadha Rao and Chiranjilal Kujur (2023); SUM CORDIAL LABELING OF CORONA PRODUCT GRAPH OF PATH TO PATH, International Journal of Advanced Research (IJAR), 11 (08), 410-414, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/17405
Corresponding Author
Article Analytics
Similar Articles
This work is licensed under a Creative Commons Attribution 4.0 International License.