New types of graphs on cordial labeling

Abstract

Let $f$ be a function from the vertices of a graph $G$ to $\{0,1\}$ and for each edge $xy$ assign the label $|f(x)-f(y)|$. $f$ is called as a \textit{cordial labeling} of $G$ if the number of vertices labeled $0$ and the number of vertices labeled $1$ differ by at most $1$ and the number of edges labeled $ 0$ and the number of edges labeled $1$ also differ at most by $1$. In this paper we prove that star glued with subdivided shell graph and super subdivision of circular ladder graph admit cordial labeling.