Cordial Labeling for Star Graphs

Abstract

Cordial labeling is used to label the vertices and edges of a graph with $\left\{ 0,1 \right\}$ under constraint, such that the number of vertices with label $0$ and $1$ differ by atmost $1$ and the number of edges with label $1$ and $0$ differ by atmost $1$. In this paper we prove that the two star graph $K_{1,m} \wedge K_{1,n} $ with a wedge in common is a cordial graph for all $m\geq1$ and $n\geq1$.