The k-path vertex cover in Cartesian product graphs and complete bipartite graphs

Zhao Li and Liancui Zuo

Applied Mathematics and Computation, 2018, vol. 331, issue C, 69-79

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 S intersects all paths of order k in G. The cardinality of a minimum k-path vertex cover is denoted by ψk(G), and called the k-path vertex cover number of G. In this paper, we study some Cartesian product graphs and give several estimations and the exact values of ψk(G).

Keywords: k-path vertex cover; Cartesian product; Strong product; Lexicographic product; Complete bipartite graph (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318301735
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:331:y:2018:i:c:p:69-79

DOI: 10.1016/j.amc.2018.03.008

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().