Square Divisor Cordial Graphs
S. Murugesan, D. Jayaraman, J. Shiama · International Journal of Computer Applications · 2013
and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1.If a graph has a square divisor cordial labeling, then it is called square divisor cordial graph.In this paper, we investigate the square divisor cordial labeling behaviour of paths, cycles, wheel graphs, star graphs, some complete bipartite graphs and complete graphs.