Further results on k-product cordial labeling
Künye
Daisy, K. J., Sabibha, R. S., Jeyanthi, P. & Youssef, M. Z. (2024). Further results on k-product cordial labeling. TWMS Journal of Applied and Engineering Mathematics, 14(3), 981-990.Özet
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edge uv assign the label f(u)f(v)(mod k). f is called a k-product cordial labeling if |vf (i) − vf (j)| ≤ 1, and |ef (i) − ef (j)| ≤ 1, i, j ∈ {0, 1, ..., k − 1}, where vf (x) and ef (x) denote the number of vertices and edges respectively labeled with x (x = 0, 1, ..., k − 1). In this paper, we investigate the k-product cordial behaviour of G + Kt. In addition, we find an upper bound of the size of connected k-product cordial graphs.
Cilt
14Sayı
3Bağlantı
https://jaem.isikun.edu.tr/web/index.php/archive/125-vol14no3/1230http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6065
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Average even divisor cordial labeling: a new variant of divisior cordial labeling
Sharma, Vishally; Parthiban, Angamuthu (Işık University Press, 2024-07)In the present paper, a new variant of divisor cordial labeling, named, an average even divisor cordial labeling, has been introduced. An average even divisor cordial labeling of a graph G* on n vertices, is defined by a ... -
Divisor cordial labeling in the context of join and barycentric subdivision
Bosmia, Mohit Ishvarlal; Kanani, Kailas Khimjibhai (Işık University Press, 2019)A divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V (G) to {1,2,...,|V(G)|} such that an edge e = uv is assigned the label 1 if f(u)|f(v) or f(v)|f(u) and the label 0 otherwise, then |e f ... -
Edge product cordial labeling of switching operation on some graphs
Prajapati, Udayan M.; Patel, Nittal B. (Işık University Press, 2022)Here we discuss and prove that the graphs attained by switching of any vertex with degree two which is adjacent to a vertex with degree two in triangular snake Tm, switching of any vertex with degree one in path Pm for m ...