Some New Results on Absolute Difference of Cubic and Square Sum Labeling of a Class of Graphs

A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. In this paper, we introduce the new concept, an absolute difference of cubic and square sum labeling of a graph. The graph for which every edge label is the absolute difference of the sum of the cubes of the end vertices and the sum of the squares of the end vertices. It is also observed that the weights of the edges are found to be multiples of 2. Here we characterize few graphs for cubic and square sum labeling.