Some new perspectives on global domination in graphs (Q361579)
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 6202996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new perspectives on global domination in graphs |
scientific article; zbMATH DE number 6202996 |
Statements
Some new perspectives on global domination in graphs (English)
0 references
29 August 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 \(\overline{G}\). Here we explore the possibility to relate the domination number of graph \(G\) and the global domination number of the larger graph obtained from \(G\) by means of various graph operations. In this paper we consider the following problem: Does the global domination number remain invariant under any graph operations? We present an affirmative answer to this problem and establish several results.
0 references
global dominating set
0 references
domination number
0 references
global domination number
0 references
0.9292291402816772
0 references
0.8912686705589294
0 references
0.8797359466552734
0 references
0.8766012191772461
0 references
