On the Construction of Cordial Graphs

Abstract

Ho and Shee [5] showed that for a graph $G$ of order $n$ $(\ge 4)$ and size $m$ to be cordial, it is necessary that $m$ must be less than $\frac{n(n-1)}{2}–\lceil \frac{n}{2}\rceil +2$.

In this paper, we prove that there exists a cordial graph of order $n$ and size $m$, where
$n-1\le m\le \frac{n(n-1)}{2}–\lceil \frac{n}{2}\rceil +1.$