On the \(k\)-path vertex cover of some graph products (Q1759813)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the k-path vertex cover of some graph products |
scientific article; zbMATH DE number 6109893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-path vertex cover of some graph products |
scientific article; zbMATH DE number 6109893 |
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
0.90117746591568
0 references
0.8926375508308411
0 references
0.8923834562301636
0 references
0.8459644913673401
0 references
0.8429920673370361
0 references
