An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (Q6580152)
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 upper bound on the total Roman \2\-domination number of graphs with minimum degree two |
scientific article; zbMATH DE number 7888122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two |
scientific article; zbMATH DE number 7888122 |
Statements
An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (English)
0 references
29 July 2024
0 references
Roman \(\{2\}\)-domination
0 references
total Roman \(\{2\}\)-domination
0 references
0.8888253569602966
0 references
0.8838450312614441
0 references
0.8825335502624512
0 references
0.8809159994125366
0 references
0.8732186555862427
0 references
