Published August 25, 2023
| Version v1
Journal article
Open
SUM CORDIAL LABELING OF CORONA PRODUCT GRAPH OF PATH TO PATH
Authors/Creators
- 1. Department of Mathematics, Kalinga University, New Raipur, Chhattisgarh-492101, India.
- 2. Department of Mathematics, St. Josephs College Darjeeling, West Bangal-734101, India.
Description
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.
Files
31.pdf
Files
(428.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d8862e0834e9cc37b12582cdfd52c9e5
|
428.6 kB | Preview Download |