Araştırma Makalesi
BibTex RIS Kaynak Göster
Yıl 2021, Cilt: 3 Sayı: 2, 17 - 26, 10.10.2021
https://doi.org/10.54286/ikjm.926656

Öz

Kaynakça

  • 1. Prajapati, U.M., and Gajjar, S.J., Cordial labeling for complement graphs,Mathematics TodayVol.30, (2015), 99–118.
  • 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.

SOME PAIR DIFFERENCE CORDIAL GRAPHS

Yıl 2021, Cilt: 3 Sayı: 2, 17 - 26, 10.10.2021
https://doi.org/10.54286/ikjm.926656

Öz

Let G = (V, E) be a (p, q) graph.
Define
ρ =
( p
2
, if p is even
p−1
2
, if p is odd
and 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 of
V 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 each
edge uv of G there exists a labeling |f(u) − f(v)| such that



∆f1 − ∆f
c
1


≤ 1,
where ∆f1
and ∆f
c
1
respectively denote the number of edges labeled with
1 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 of
Pn ⊙ K1,Pn ⊙ K2,Cn ⊙ K1,Pn ⊙ 2K1,Ln ⊙ K1,Gn ⊙ K1, where Gn is a gear
graph and e

Kaynakça

  • 1. Prajapati, U.M., and Gajjar, S.J., Cordial labeling for complement graphs,Mathematics TodayVol.30, (2015), 99–118.
  • 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.
Toplam 2 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Matematik
Bölüm Makaleler
Yazarlar

R Ponraj

Gayathrı A

S Somasndaram

Yayımlanma Tarihi 10 Ekim 2021
Kabul Tarihi 15 Ekim 2021
Yayımlandığı Sayı Yıl 2021 Cilt: 3 Sayı: 2

Kaynak Göster

APA Ponraj, R., A, G., & Somasndaram, S. (2021). SOME PAIR DIFFERENCE CORDIAL GRAPHS. Ikonion Journal of Mathematics, 3(2), 17-26. https://doi.org/10.54286/ikjm.926656
AMA Ponraj R, A G, Somasndaram S. SOME PAIR DIFFERENCE CORDIAL GRAPHS. ikjm. Ekim 2021;3(2):17-26. doi:10.54286/ikjm.926656
Chicago Ponraj, R, Gayathrı A, ve S Somasndaram. “SOME PAIR DIFFERENCE CORDIAL GRAPHS”. Ikonion Journal of Mathematics 3, sy. 2 (Ekim 2021): 17-26. https://doi.org/10.54286/ikjm.926656.
EndNote Ponraj R, A G, Somasndaram S (01 Ekim 2021) SOME PAIR DIFFERENCE CORDIAL GRAPHS. Ikonion Journal of Mathematics 3 2 17–26.
IEEE R. Ponraj, G. A, ve S. Somasndaram, “SOME PAIR DIFFERENCE CORDIAL GRAPHS”, ikjm, c. 3, sy. 2, ss. 17–26, 2021, doi: 10.54286/ikjm.926656.
ISNAD Ponraj, R vd. “SOME PAIR DIFFERENCE CORDIAL GRAPHS”. Ikonion Journal of Mathematics 3/2 (Ekim 2021), 17-26. https://doi.org/10.54286/ikjm.926656.
JAMA Ponraj R, A G, Somasndaram S. SOME PAIR DIFFERENCE CORDIAL GRAPHS. ikjm. 2021;3:17–26.
MLA Ponraj, R vd. “SOME PAIR DIFFERENCE CORDIAL GRAPHS”. Ikonion Journal of Mathematics, c. 3, sy. 2, 2021, ss. 17-26, doi:10.54286/ikjm.926656.
Vancouver Ponraj R, A G, Somasndaram S. SOME PAIR DIFFERENCE CORDIAL GRAPHS. ikjm. 2021;3(2):17-26.