Cordiality of a Star of the Complete Graph and a Cycle Graph $C(N\cdot K_{N})$


  •  V. J. Kaneria    
  •  H. M. Makadia    
  •  Meera Meghpara    

Abstract

In this paper we prove that a star of $K_{n}$ and a cycle of $n$ copies of $K_{n}$ are cordial. We also get condition for maximum value of $e_{f}(1)-e_{f}(0)$ and highest negative value of $e_{f}(1)-e_{f}(0)$ in $K_{n}$, where $f$ is the binary vertex labeling function on the vertex set of $K_{n}$.



This work is licensed under a Creative Commons Attribution 4.0 License.