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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.06.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2958098820 / rank | |||
Normal rank | |||
Revision as of 18:18, 19 March 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
