The global connected co-independent domination of a graph
A. Sasireka, D. Udayakumar · Bulletin of Pure & Applied Sciences- Mathematics and Statistics · 2011
A dominating set D ⊆ V(G) of a graph G is said to be a global connected dominating set if the induced subgraph (D) is global dominating set and connected set of G. The minimum cardinality of a global connected dominating set is the global connected domination number yc(G). In this paper we introduce global connected co-independent domination number of a graph and study some properties and bounds on it.