Advanced computational methods for compact mean labeling in star graphs
A. Sagaya Rose Tucilin Marysagayarose1412@gmail.comDepartment of MathematicsPallavaramVels Institute of Science Technology & Advanced Studies (VISTAS)Chennai, Tamil Nadu, 600117, India0009-0005-3416-4155View full profile → , *V. MaheswariCorresponding authormaheswari.sbs@vistas.ac.inDepartment of MathematicsPallavaramVels Institute of Science Technology & Advanced Studies (VISTAS)Chennai, Tamil Nadu, 600117, India0000-0002-7268-9420View full profile → , V. Balajipulibala70@gmail.comDepartment of MathematicsSacred Heart College (Autonomous)Thirupattur, Tamil Nadu, 635601, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 May 2025
- Published Online:
- 20 Jun 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2570
- Pages:
- 2289–2297
Abstract
Keywords
Subject Classifications
References
[1] S. A. Kumar, S. H. Pratap, K. Shakti, T. P. Kumar, and R. A. Singh, “Estimating computer network security scenarios with association rules,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-A, pp. 223–236 (Mar. 2024), doi: 10.47974/JDMSC-1876.
[2] P. Sunita, S. Pachar, D. Kapila, J. C. Cotrina-Aliaga, S. Aggarwal, and U. Mamodiya, “Efficient cost evaluation of real time applications using mathematical model in computing environment,” Journal of Interdisciplinary Mathematics, vol. 26, no. 3, pp. 531–541 (Apr. 2023), doi: 10.47974/JIM-1679.
[3] A. Rosa, “On certain valuations of the vertices of a graph,” Journal of Graph Theory - JGT, Vol. 1, pp. 349-355 (Jan. 1967).
[4] S. W. Golomb, “HOW TO NUMBER A GRAPH,” Graph Theory and Computing, pp. 23–37 (Jan. 1972), doi: 10.1016/B978-1-4832-3187-7.50008-8.
[5] E. Kay, J. A. Bondy, and U. S. R. Murty, “Graph Theory with Applications,” Operational Research Quarterly (1970-1977), vol. 28, no. 1 (1977), doi: 10.2307/3008805.
[6] Z. Wang, L. Dueñas-Osorio, and J. E. Padgett, “A new mutually reinforcing network node and link ranking algorithm,” Sci. Rep., vol. 5, no. 1, p. 15141 (2015), doi: 10.1038/srep15141.
[7] S. El-Zanati, H.-L. Fu, and C.-L. Shiue, “On the-labeling number of bipartite graphs,” (2000). [Online]. Available: www.elsevier.com
[8] P. B. Kumar, C. Sujata, N. Bighnaraj, N. S. Ranjan, and P. R. Chandra, “Leveraging ensemble learning for enhanced security in credit card transaction fraudulent within smart cities for cybersecurity challenges,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 4, pp. 1233–1246 (Jun. 2024), doi: 10.47974/JDMSC-1978.
[9] S. Arumugam, G. S. Bloom, M. Miller, and J. Ryan, “Some Open Problems on Graph Labelings,” AKCE International Journal of Graphs and Combinatorics, vol. 6, no. 1, pp. 229–236 (2009), doi: 10.1080/09728600.2009.12088890.
[10] V. Maheswari, D. S. T. Ramesh, and V Balaji, “On skolem mean labeling,” Bulletin of Kerala Mathematics Association, vol. 10, no. 1, pp. 89–94 (2013).
[11] V. Maheswari, D. S. T. Ramesh, and V. Balaji, “Some Results on Relaxed Mean Labeling,” International Journal of Mathematical Combinatorics, vol. 3, pp. 73–80 (2015), [Online]. Available: http://www.ebsco.com/home/printsubs/priceproj.asp
[12] V. Maheswari, D. S. T. Ramesh, S. Francis, and V. Balaji, “On relaxed mean labeling,” Bulletin of Kerala Mathematics Association, vol. 12, no. 1, pp. 54–64 (Jun. 2015).
[13] V. N. Jaya Shruthy and V. Maheswari, “Double Encryption, Decryption Process Using Graph Labeling Through Enhanced Vigenere Cipher,” J. Phys. Conf. Ser., vol. 1362, no. 1, p. 012023 (2019), doi: 10.1088/1742-6596/1362/1/012023.
[14] S. Rekha and V. Maheswari, “Difference modulo labeling,” in Journal of Physics: Conference Series (2019). doi: 10.1088/1742-6596/1362/ 1/012049.
[15] G. Sarmitha, S. Vidyanandini, and N. S. Ranjan, “Square difference labeling and co-secure domination in middle graph of certain graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 4, pp. 1403–1413 (Jun. 2024), doi: 10.47974/JDMSC-1994.
[16] C. Barrientos and M. Youssef, “Relaxing the injectivity constraint on arithmetic and harmonious labelings,” Electronic Journal of Graph Theory and Applications, vol. 10, pp. 523–539 (Nov. 2022), doi: 10.5614/ejgta.2022.10.2.13.
[17] V. Deepa, V. Maheswari, and V. Balaji, “Creating Ciphertext and Decipher using Graph Labeling Techniques,” Int. J. Eng. Adv. Technol., vol. 9, no. 1S (Oct. 2019).
[18] K. Subramaniyan, V. Maheswari, V. Balaji, S. Rekha, and R. Scholar, “Compact Mean Labeling,” International Journal of Scientific Research in Science and Technology (IJSRST), vol. 9, no. 5, pp. 327–330 (2022), doi: 10.32628/IJSRST.
[19] V. J. Kaneria, H. M. Makadia, M. M. Jariya, and M. Meghapara, “Graceful labeling for complete bipartite graphs,” Applied Mathematical Sciences, vol. 8, no. 101–104 (2014), doi: 10.12988/ams.2014.46488.
[20] S. Ezhilarasi and M. Kavitha, “A study on labelling for star graphs,” Malaya Journal of Matematik, vol. S, no. 1, pp. 377–379 (2021), doi: 10.26637/MJMS2101/0083.
[21] P. Janaki, V. Maheswari, and V. Balaji, “Difference divisor labeling for graph-based cryptographic applications: a novel approach to secure encoding,” International Journal of Information Technology (Jan. 2026), doi: 10.1007/s41870-025-03041-7.
[22] M. Nandhini, V. Maheswari, and V. Balaji, “Possibilities of Edge Repetition using Double Mean Labeling,” in 2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT), pp. 1–8 (2023), doi: 10.1109/ICECCT56650.2023.10179740.
[23] V. Maheswari, D. S. T. Ramesh, and V. Balaji, “Relaxed mean labeling,” International Journal of Mathematics Research, vol. 4, no. 3, pp. 217–224 (2012).
[24] A. Sagaya Rose Tucilin Mary and V. Maheswari, “Investigation of Compact Mean Labeling Using Complete Bipartite Graph,” in 2025 International Conference on Sustainability, Innovation & Technology (ICSIT), pp. 1–5 (2025), doi: 10.1109/ICSIT65336.2025.11294376.
