An upper bound on the domination number of \(n\)-vertex connected cubic graphs (Q1011787)
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: An upper bound on the domination number of \(n\)-vertex connected cubic graphs |
scientific article; zbMATH DE number 5542434
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the domination number of \(n\)-vertex connected cubic graphs |
scientific article; zbMATH DE number 5542434 |
Statements
An upper bound on the domination number of \(n\)-vertex connected cubic graphs (English)
0 references
9 April 2009
0 references
cubic graphs
0 references
domination
0 references
connected graphs
0 references
