论文部分内容阅读
For the subset S■V(G), if every path with k vertices in a graph G contains at least one vertex from S, we call that S 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