Further results on k-product cordial labeling
Citation
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.Abstract
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.
Volume
14Issue
3URI
https://jaem.isikun.edu.tr/web/index.php/archive/125-vol14no3/1230http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6065
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
K-product cordial labeling of fan graphs
Daisy, K. Jeya; Sabibha, R. Santrin; Jeyanthi, Pon; Youssef, Maged Z. (Işık University Press, 2023-01)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) ? ... -
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 ... -
Encryption through square grid automata
Mary, Francis Remigius Perpetua; Shobana, Loganathan; Sujatha, Ramalingam (Işık University Press, 2023-01)In this paper, a new approach to encrypt and decrypt messages by implementing the concept of cordial words and cordial numbers to square grid automaton is being analyzed.