Some new results on global dominating sets (Q1935987)
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 6137704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new results on global dominating sets |
scientific article; zbMATH DE number 6137704 |
Statements
Some new results on global dominating sets (English)
0 references
21 February 2013
0 references
Summary: A dominating set is called a global dominating set if it is a dominating set of a graph \(G\) and its complement \(\bar G\). A natural question arises: are there any graphs for which it is possible to relate the domination number and the global domination number? We have found an affirmative answer to this question and obtained some graphs having such characteristic.
0 references
global dominating set
0 references
global domination number
0 references
0.950101673603058
0 references
0.9292291402816772
0 references
0.8964590430259705
0 references
0.892193078994751
0 references
