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 this page instead for the normal view: An improved upper bound on the double Roman domination number of graphs with minimum degree at least two |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved upper bound on the double Roman domination number of graphs with minimum degree at least two |
scientific article |
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