Further results on Parity Combination Cordial Labeling
Seoud, M., Aboshady, M. (2020). Further results on Parity Combination Cordial Labeling. EKB Journal Management System, 28(1), 1-10. doi: 10.1186/s42787-020-00082-8
Mohamed Seoud; Mohamed Aboshady. "Further results on Parity Combination Cordial Labeling". EKB Journal Management System, 28, 1, 2020, 1-10. doi: 10.1186/s42787-020-00082-8
Seoud, M., Aboshady, M. (2020). 'Further results on Parity Combination Cordial Labeling', EKB Journal Management System, 28(1), pp. 1-10. doi: 10.1186/s42787-020-00082-8
Seoud, M., Aboshady, M. Further results on Parity Combination Cordial Labeling. EKB Journal Management System, 2020; 28(1): 1-10. doi: 10.1186/s42787-020-00082-8

Further results on Parity Combination Cordial Labeling

Journal of the Egyptian Mathematical Society
Volume 28, Issue 1, June 2020, Page 1-10  XML PDF (1.43 MB)
DOI: 10.1186/s42787-020-00082-8
View on SCiNiTO View on SCiNiTO
Authors
Mohamed Seoud; Mohamed Aboshady
Department of Basic Science, Faculty of Engineering, The British University in Egypt, Cairo, Egypt
Abstract
Let G be a (p, q)-graph. Let f be an injective mapping from V(G) to {1, 2, …, p}. For
each edge xy, assign the label ð
x
y
Þ or ð
y
x
Þ according as x > y or y > x. Call f a parity
combination cordial labeling if |ef(0) − ef(1)| ≤ 1, where ef(0) and ef(1) denote the
number of edges labeled with an even number and an odd number, respectively. In
this paper we make a survey on all graphs of order at most six and find out whether
they satisfy a parity combination cordial labeling or not and get an upper bound for
the number of edges q of any graph to satisfy this condition and describe the parity
combination cordial labeling for two families of graphs.
Statistics
Article View: 39
PDF Download: 27