Square Divisor Cordial Graphs

Abstract

A square divisor cordial labeling of a graph G with vertex set V is a bijectionf from V tof1;2;:::;j Vjg such that if each edgeuv is assigned the label 1 if [f (u)] 2 jf (v) or [f (v)] 2 jf (u) 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.