Vertex cover number for special classes of corona and tensor products
A. Shenbaga Priyaaspriyaramesh5@gmail.comDepartment of MathematicsHindustan Institute of Technology and ScienceChennai, Tamil Nadu, 603103, India0009-0009-1661-289XView full profile → , *R. Sundara RajanCorresponding authorvprsundar@gmail.comDepartment of MathematicsRajalakshmi Engineering CollegeChennai, Tamil Nadu, 602105, India0000-0002-1851-6334View full profile → , Indra Rajasinghindrarajasingh@yahoo.comDepartment of MathematicsSaveetha School of Engineering (SIMATSChennai, Tamil Nadu, 602105, India0000-0002-9721-9505View full profile → , V. Govindangovindoviya@gmail.comDepartment of MathematicsHindustan Institute of Technology and ScienceChennai, Tamil Nadu, 603103, India0000-0003-4750-1964View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 May 2025
- Published Online:
- 08 Apr 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2571
- Pages:
- 1765–1776
Abstract
Keywords
Subject Classifications
References
[1] F. Kuhn and M. Mastrolilli, “Vertex cover in graphs with locally few colors,” Information and Computation, vol. 222, pp. 265-277 (2013).
[2] P. Titus, M. Subha, and S. S. Kumari, “Monophonic graphoidal covering number of corona product graphs,” Proyecciones Journal of Mathematics, vol. 42, no. 2, pp. 303-318 (2023).
[3] R. Frucht and F. Harary, “On the corona of two graphs,” Aequationes Mathematicae, vol. 4, no. 3, pp. 322-325 (1970).
[4] K. S. Kumar, N. G. David, and K. G. Subramanian, “Power dominator coloring of corona graphs,” International Journal of Pure and Applied Mathematics, vol. 118, no. 23, pp. 59-67 (2018).
[5] H. Jiang, A. A. Talebi, Z. Shao, S. H. Sadati, and H. Rashmanlou, “New concepts of vertex covering in cubic graphs with its applications,” International Journal of Scientific Research and Review, vol. 10, no. 307, pp. 1-29 (2022).
[6] A. P. Batuwita, M. D. M. C. P. Weerarathna, and D. W. M. M. K. Dheerasinghe, “Prime labeling of circular ladder graph (CLn),” Iconic Research and Engineering Journals, vol. 4, no. 10, pp. 192-195 (2021).
[7] J. F. Fang, “The bipancycle-connectivity of the hypercube,” Information Sciences, vol. 178, no. 24, pp. 4679-4687 (2008).
[8] J. Anitha and S. Muthukumar, “Power domination in splitting and degree splitting graph,” Proyecciones Journal of Mathematics, vol. 40, no. 6, pp. 1641-1655 (2021).
[9] A. Vijayan and T. S. I. Helan, “On the vertex covering sets and vertex cover polynomials of square of ladder graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 19, no. 2, pp. 342-360 (2016).
[10] J. Anitha and I. R. Singh, “1-factor forcing in certain interconnection networks,” Procedia Computer Science, vol. 172, pp. 187-192 (2020).
[11] T. Sitthiwirattham, “Vertex covering and independent number on difference graphs,” International Journal of Pure and Applied Mathematics, vol. 77, no. 4, pp. 543-547 (2012).
[12] A. Joselito and V. P. Abregana, “Revisiting the vertex cover of graphs,” Applied Mathematical Sciences, vol. 9, no. 115, pp. 5707-5714 (2015).
[13] U. P. Acharya and H. S. Mehta, “2-tensor product of graphs,” International Journal of Mathematics and Scientific Computing, vol. 4, no. 1, pp. 21-24 (2014).
[14] H. P. Patil and V. Raja, “On tensor product of graphs, girth and triangles,” Iranian Journal of Mathematical Sciences and Informatics, vol. 10, no. 1, pp. 139-147 (2015).
[15] J. A. Hassan, S. R. Canoy, A. Gamorez, E. C. Ahmad, and A. N. S. Sappari, “2-Vertex covering of a graph,” European Journal of Pure and Applied Mathematics, vol. 18, no. 2, pp. 1307-5543 (2025).
[16] S. R. Canoy, M. A. O. Bonsocan, J. A. Hassan, A. M. L. Mahistrado, and V. T. Bilar, “Super vertex cover of a graph,” European Journal of Pure and Applied Mathematics,
[17] A. Kumar and R. Gupta, “Graph theoretic applications in network optimization,” Journal of Information and Optimization Sciences, vol. 41, no. 3, pp. 789-801 (2020).
[18] M. Singh and P. Sharma, “Applications of discrete structures in cryptography,” Journal of Interdisciplinary Mathematics, vol. 24, no. 4, pp. 915-928 (2021).
[19] S. K. Vaidya and N. J. Kothari, “Edge domination in certain classes of graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 4, pp. 547-556 (2019).
[20] R. Gupta and P. K. Sharma, “Applications of graph theory in communication networks,” Journal of Information and Optimization Sciences, vol. 39, no. 5, pp. 1101-1112 (2018).vol. 18, no. 1, pp. 1307-5543 (2025).




