Minimum k-Path Vertex Cover in Cartesian Product Graphs

摘要

For the subset S■V(G),if every path with k vertices in a graph G contains at least one vertex from 5,we call that 5 is a k-path vertex cover set of the graph G.Obviously,the subset is not unique.The cardinality of the minimum k-path vertex cover set of a graph G is called the k-path vertex cover number,we denote it by ψk(G)-In this paper,a lower or upper bound of ψk for some Cartesian product graphs is presented.