Novel classes of integers and their applications in graph labeling

Year 2021, Volume: 50 Issue: 4, 1094 - 1110, 06.08.2021

Shahbaz Ali , Muhammad Khalid Mahmood K. P. Shum

https://doi.org/10.15672/hujms.825723

Cited By: 5

Abstract

Adding new classes of integers to literature is both challenging and charming. Until a new class is completely characterized, mathematics is never going to be worth it. While it's absurd to play with integers without intended consequences. In this work, we introduce and investigate four new classes of integers namely, anti-totient numbers, half anti-totient numbers, near Zumkeller numbers and half near Zumkeller numbers by using the notion of non-coprime residues of $n$ including $n$. We formulate and propose relations of these new classes of numbers with previous well-known numbers such as perfect, totient, triangular, pentagonal, and hexagonal numbers. These new classes of integers have been completely characterized. Finally, as an application of these new classes of numbers, a new graph labeling is also proposed on anti-totient numbers.

Keywords

Anti-totient number, Half anti-totient number, near Zumkeller number, half near Zumkeller number, graph labeling

References

• [1] S. Babitha and J. Baskar, Prime cordial labeling on graphs, Int. J. Math. Math. Sci. 7 (1), 43–48, 2013.
• [2] B.J. Balamurugan, K. Thirusangu and D.G. Thomas, Algorithms for Zumkeller labeling of full binary trees and square grids, Artif. Intell. Evol. Algorithms Eng. Syst. Springer India, 183–192, 2015.
• [3] D.M. Burton, Elementary Number Theory, McGraw-Hill, 2007.
• [4] S. Clark, J. Dalzell, J. Holliday, D. Leach, M. Liatti and M.Walsh, Zumkeller numbers, In Math. Abund. Conf. (Illinois State Univ.), April 18th, 2008.
• [5] V.H. Dinh and M. Rosenfeld, A new labeling of $C_{2n}$ proves that $K_{4} + M_{6n}$ decomposes $K_{6n}+4$, Ars Combin. 4, 255–267, 2018.
• [6] K. Eshghi and P. Azimi, Applications of mathematical programming in graceful labeling of graphs, J. Appl. Math. 1, 1–8, 2004.
• [7] J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Comb. 16 (6), 1–219, 2009.
• [8] F. Harary, Graph Theory, Addision-Wesley, 1972.
• [9] J. Harrington and T.W. Wong, On super totient numbers and super totient labelings of graphs, Discrete Math. 343 (2), 111670, 2020.
• [10] M. Hussain and M. Tabraiz, Super d-anti-magic labeling of subdivided kC5, Turkish J. Math. 39 (5), 773–783, 2015.
• [11] M. Khalid and A. Shahbaz, A Novel Labeling Algorithm on Several Classes of Graphs, Punjab Univ. J. Math. 49, 23–35, 2017.
• [12] M. Khalid and A. Shahbaz, On Super Totient Numbers, With Applications And Algorithms To Graph Labeling, Ars Combin. 2, 29–37, 2019.
• [13] Y. Peng and K.R. Bhaskara, On Zumkeller Numbers, J. Number Theory, 133 (4), 1135–1155, 2013.
• [14] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris, 349–355, 1967.
• [15] A. Shahbaz and M. Khalid, New Numbers on Euler’s Totient Function with Applications, J. Math. Ext. 14 (1), 61–83, 2020.
• [16] M. Seoud and S. Salman, Some results and examples on difference cordial graphs, Turkish J. Math. 40 (2), 417–427, 2016.
• [17] M. Seoud and M. Salim, Further results on edge-odd graceful graphs, Turkish J. Math. 40 (3), 647–656, 2016.
• [18] S. Somasundaram and R. Ponraj, Mean labelings of graphs, Natl. Acad. Sci. Lett. 26 (7), 210–213, 2003.