Some Results on Specific Graphs

Abstract

The aim of this paper is to show that the corona $P_n⨀P_m$ between two paths $P_n$ and $P_m$ is cordial for all $n\ge 1$ and $m\ge 1$. Also, we prove that except for $n$ and $m$ being congruent to $2(\mathrm{mod}4)$, the corona $C_n⨀C_m$ between two cycles $C_n$ and $C_m$ is cordial. Furthermore, we show that if $n\equiv 2(\mathrm{mod}4)$ and $m$ is odd, then $C_n⨀C_m$ is not cordial.