An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052)
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 7127279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound on the double Roman domination number of graphs with minimum degree at least two |
scientific article; zbMATH DE number 7127279 |
Statements
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (English)
0 references
6 November 2019
0 references
double Roman domination number
0 references
Roman domination
0 references
domination
0 references
0.9779691696166992
0 references
0.9725571870803832
0 references
0.9523378014564514
0 references
0.9505348205566406
0 references
