Upper bounds on Roman domination numbers of graphs (Q764908)
From MaRDI portal
!
WARNING
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 6015232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on Roman domination numbers of graphs |
scientific article; zbMATH DE number 6015232 |
Statements
Upper bounds on Roman domination numbers of graphs (English)
0 references
16 March 2012
0 references
domination
0 references
Roman domination
0 references
minimum degree
0 references
forbidden subgraph
0 references
cocomparability graph
0 references
0.9146080017089844
0 references
0.913249373435974
0 references
0.8988877534866333
0 references
0.897397518157959
0 references
0.8964172601699829
0 references
