Maged Z. Youssef
Department of Mathematics Ain Shams University, Abbassia, Cairo, Egypt.

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

k-Product Cordial Behaviour of Union of Graphs K. Jeya Daisey; R. Santrin Sabibha; P. Jeyanthi; Maged Z. Youssef
Journal of the Indonesian Mathematical Society VOLUME 28 NUMBER 1 (MARCH 2022)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.28.1.1025.1-7

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 union of graphs