Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247)
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 6592575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved upper bounds on the domination number of graphs with minimum degree at least five |
scientific article; zbMATH DE number 6592575 |
Statements
Improved upper bounds on the domination number of graphs with minimum degree at least five (English)
0 references
13 June 2016
0 references
domination number
0 references
minimum degree
0 references
greedy algorithm
0 references
0 references
0.885707437992096
0 references
0.8645076155662537
0 references
0.864495038986206
0 references
0.8555068969726562
0 references
