Broader families of cordial graphs
A binary labeling of the vertices of a graph Combination Vacuum Floor Tool G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.In this paper we present general results involving the cordiality of graphs