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.