TY  - JOUR
T1  - SOME PAIR DIFFERENCE CORDIAL GRAPHS
AU  - Ponraj, R
AU  - A, Gayathrı
AU  - Somasndaram, S
PY  - 2021
DA  - October
Y2  - 2021
DO  - 10.54286/ikjm.926656
JF  - Ikonion Journal of Mathematics
JO  - ikjm
PB  - Nihat AKGÜNEŞ
WT  - DergiPark
SN  - 2687-6531
SP  - 17
EP  - 26
VL  - 3
IS  - 2
LA  - en
AB  - Let G = (V, E) be a (p, q) graph.Defineρ =( p2, if p is evenp−12, if p is oddand L = {±1, ±2, ±3, · · · , ±ρ} called the set of labels.Consider a mapping f : V −→ L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements ofV and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for eachedge uv of G there exists a labeling |f(u) − f(v)| such that∆f1 − ∆fc1 ≤ 1,where ∆f1and ∆fc1respectively denote the number of edges labeled with1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph.In this paper we investigate the pair difference cordial labeling behavior ofPn ⊙ K1,Pn ⊙ K2,Cn ⊙ K1,Pn ⊙ 2K1,Ln ⊙ K1,Gn ⊙ K1, where Gn is a geargraph and e
KW  - path
KW  - cycle
KW  - complet graph
KW  - ladder
CR  - 1. Prajapati, U.M., and Gajjar, S.J., Cordial labeling for complement graphs,Mathematics TodayVol.30, (2015), 99–118.
CR  - 2. Prajapati, U.M., and Gajjar, S.J., Some results on prime cordial labeling of generalized prism
graph Ym,n,Ultra ScientistVol.27(3)A, (2015), 189–204.
UR  - https://doi.org/10.54286/ikjm.926656
L1  - https://dergipark.org.tr/en/download/article-file/1729055
ER  -