International Journal of Mathematics Trends and Technology
Volume 36 | Number 1 | Year 2016 | Article Id. IJMTT-V36P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V36P509
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.
[1] Mathew Varkey T K , Sunoj B S, A Note on Absolute Difference of Cubic and Square Sum Labeling of a Class of Trees, International Journal of Scientific Engineering and Applied Science - Volume- 2, Issue- 8 ,August 2016
[2] F Harary, Graph Theory, Addison-Wesley,Reading, Mass, (1972)
[3] Joseph A Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics(2015), #DS6.
[4] T K Mathew Varkey, Some Graph Theoretic Generations Associated with Graph Labeling, PhD Thesis, University of Kerala 2000.
Dr.Mathew Varkey T K, Sunoj B S, "An Absolute Difference of Cubic and Square Sum Labeling of Certain Class of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 36, no. 1, pp. 77-79, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V36P509
PDF 
Abstract 
Keywords 
References 
Citation