Extended Chain of Domination Parameters in Graphs. (26th September 2013)

• Record Type: Journal Article
• Authors: Hamid, I. Sahul; Balamurugan, S.
• Other Names: Alspach B. Academic Editor.; Hu S. Academic Editor.; Hua H. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-09-26
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/792743
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : A subset S of the vertex set V ( G ) of a graph G is called an isolate set if the subgraph induced by S has an isolated vertex. The subset S is called an isolate dominating set if it is both isolate and dominating. Also, S is called an isolate irredundant set if it is both isolate and irredundant. In this paper, we establish a chain connecting various isolate parameters with the existing domination parameters and discuss equality among the parameters in the extended chain.