THE CORDIAL LABELING FOR THE CARTESIAN PRODUCT BETWEEN PATHS AND CYCLES
Mohammed M. Ali Al-Shamiri, Ashraf ELrokh, Yasser El –Mashtawye, S. Euat Tallah · International Journal of Research -GRANTHAALAYAH · 2020
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this paper we show the Cartesian product of a path and a cycle or vice versa are always cordial under some conditions. Also, we prove that the Cartesian product of two paths is cordial.