On the \(k\)-path vertex cover of some graph products
type: Item
instance of: scholarly article
title: On the \(k\)-path vertex cover of some graph products
zbMATH Open document ID: 1264.05102
author: Marko Jakovac
author: Andrej Taranenko
published in: Discrete Mathematics
publication date: 2012-11-22T00:00:00Z
review text: 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.
reviewed by: Ingo Schiermeyer
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 6109893
zbMATH Keywords: k-path vertex cover
zbMATH Keywords: vertex cover
zbMATH Keywords: dissociation number
zbMATH Keywords: independence number
zbMATH Keywords: graph products
zbMATH Keywords: minimum cardinality
zbMATH Keywords: upper bounds
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: j.disc.2012.09.010
OpenAlex ID: W2019831445
DOI: 10.1016/J.DISC.2012.09.010
description: scientific article; zbMATH DE number 6109893