Some new results on global dominating sets
type: Item
instance of: scholarly article
title: Some new results on global dominating sets
zbMATH Open document ID: 1257.05124
DOI: 10.5402/2012/852129
author: R. M. Pandit
author: S. K. Vaidya
published in: ISRN Discrete Mathematics
publication date: 2013-02-21T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6137704
zbMATH Keywords: global dominating set
zbMATH Keywords: global domination number
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.5402/2012/852129
OpenAlex ID: W2070880802
Wikidata QID: Q58692831
cites work: Q3353057
cites work: Factor domination in graphs
cites work: On roman, global and restrained domination in graphs
cites work: Global domination and neighborhood numbers in Boolean function graph of a graph
cites work: Q3139533
cites work: The total global domination number of a graph
cites work: The cordiality of the path-union of \(n\) copies of a graph
cites work: Q4368728
description: scientific article; zbMATH DE number 6137704