3-Total Super Sum Cordial Labeling by Applying Operations on some Graphs

The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Super Sum Cordial labeling. This labeling is discussed by applying union operation on some of the graphs. A vertex labeling is assigned as a whole number within the range. For each edge of the graph, assign the label, according to some definite rule, defined for the investigated labeling. Any graph which satisfies 3-Total Super Sum Cordial labeling is known as the 3-Total Super Sum Cordial graphs. Here, we prove that some of the graphs like the union of Cycle and Path graphs, the union of Cycle and Complete Bipartite graph and the union of Path and Complete Bipartite graph satisfy the investigated labeling and hence are called the 3-Total Super Sum Cordial graphs