On the \(k\)-path vertex cover of some graph products (Q1759813): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.09.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019831445 / rank | |||
Normal rank | |||
Revision as of 00:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the \(k\)-path vertex cover of some graph products |
scientific article |
Statements
On the \(k\)-path vertex cover of some graph products (English)
0 references
22 November 2012
0 references
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.
0 references
k-path vertex cover
0 references
vertex cover
0 references
dissociation number
0 references
independence number
0 references
graph products
0 references
minimum cardinality
0 references
upper bounds
0 references
lower bounds
0 references
