On the \(k\)-path vertex cover of some graph products
A subset \(S\) of vertices of a graph \(G\) is called a \(k\)-path vertex cover if every path of order \(k\) in \(G\) contains at least one vertex from \(S\). Denote by \(\psi_k(G)\) the minimum cardinality of a \(k\)-path vertex cover in \(G\). In this paper exact values as well as upper and lower bounds for \(\psi_k(G)\) are computed for various graph products.
scientific article; zbMATH DE number 6109893