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 the normal view instead:
scientific article; zbMATH DE number 5542434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9742277264595032
0 references
0.9513786435127258
0 references
0.937758445739746
0 references
0.898267924785614
0 references
0.8673622012138367
0 references
