Cordial Labelling Of K-Regular Bipartite Graphs for K = 1, 2, N, N-1 Where K Is Cardinality of Each Bipartition

Abstract

In the labelling of graphs one of the types is cordial labelling. In this we label the vertices 0 or 1 and then every edge will have a label 0 or 1 if the end vertices of the edge have same or different labellings respectively. Here we are going find whether a k-regular bipartite graph can be cordial for different values of k.  labeled edges of number labeled edges of number labeled vertives of number labeled vertices of number