Abstract
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 2-tuple graphs of middle graph of paths and cycles, crown graph ,star graphs , the triangular snake graph, quadrilateral snake graph for adcss labeling.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.