TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Vertex cover number for special classes of corona and tensor products

, * , ,

* Corresponding author · click or hover a name for details

pp. 1765–1776Vol. 29Issue 4April 2026DOI: 10.47974/JDMSC-2571 Crossmark XML
Received:
01 May 2025
Published Online:
08 Apr 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2571
Pages:
1765–1776

Abstract

Given a graph denoted by G, a vertex cover refers to a selection S taken from the node set V(G) with the condition that every line in the edge set E(G) contains at least one of its endpoints within S. To put it more simply, for each edge (uv) ∈ E(G), either node u or node v (or both) must be included in the set S. The vertex cover number of G, denoted by β(G), gives the minimum size of a node cover among all possible vertex covers of G. This work focuses on determining the vertex cover number of special classes of corona product graphs, in particular, G ʘ Pn, G ʘ Cn, G ʘ Kn, G ʘ COL(l, r), G ʘ ECL(l, r), G ʘ S(Ln), and G ʘ S(Pn), where Pn, Cn, Kn, COL(l, r), ECL(l, r), S(Ln), and S(Pn) denotes a path, cycle, complete graph, cycle-of-ladder, extended cycle-of-ladder, splitting graph constructed from the ladder graph and splitting graph obtained from a path graph, respectively. Additionally, this work obtains the vertex cover number for the tensor product of any non-bipartite graph G of size n with a path Pm and a cycle Cm.

Keywords

Subject Classifications

05C6905C7605C0505C3805C60

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).

Views: 302Downloads: 187Citations: 0