Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089)
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 7324278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the \(k\)-tuple (Roman) domination number of a graph |
scientific article; zbMATH DE number 7324278 |
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
0 references
0.9341974258422852
0 references
0.9187129735946656
0 references
0.8641955852508545
0 references
0.8445652723312378
0 references
