Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the \(k\)-tuple (Roman) domination number of a graph |
scientific article |
Statements
Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (English)
0 references
17 March 2021
0 references
\(k\)-tuple domination
0 references
Roman domination
0 references
vertex cover
0 references
Brooks' theorem
0 references
