Broader families of cordial graphs

A binary labeling of the vertices of a graph G is cordial if rosy teacup dogwood 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 lock shock and barrel art we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision.In addition we show a family of cordial circulant graphs.