Bitao Zhang, Liancui Zuo, "The k-Path Vertex Cover of Some Product Graphs," WSEAS Transactions on Mathematics, vol. 15, pp. 374-384, 2016, DOI:
Bitao Zhang, Liancui Zuo. The k-Path Vertex Cover of Some Product Graphs.
WSEAS Transactions on Mathematics. 2016;15:374-384.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 15, 2016
The k-Path Vertex Cover of Some Product Graphs
Authors: ,
Abstract: For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is denoted by k(G). In this paper, we give some bounds and the exact values in special cases for k of the Cartesian, and lexicographic products of some graphs.
Pages: 374-384 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 15, 2016, Art. #35 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools