An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127529762, #quickstatements; #temporary_batch_1722035971323 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2019.06.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2019.06.018 / rank | |||
Normal rank | |||
Latest revision as of 02:41, 18 December 2024
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
