Some New Perspectives on Global Domination in Graphs. (20th August 2013)

• Record Type: Journal Article
• Authors: Vaidya, S. K.; Pandit, R. M.
• Other Names: Garcia-Vazquez P. Academic Editor.; Jorgensen P. E. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-08-20
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/201654
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : A dominating set is called a global dominating set if it is a dominating set of a graph G and its complement 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.