1Department of Mathematics, K.L.N. College of Engineering, Pottapalayam, Sivagangai District -630 611, Tamil Nadu, India. E-mail: sasireka07@yahoo.co.in
2Department of Mathematics, Government College of Arts and Science (Autonomous), Karur-639 005, Tamil Nadu, India. E-mail: drduk80@rediffmail.com
Online published on 22 February, 2013.
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.
Connected domination, Global connected domination, Connected co-independent domination, Global connected coindependent domination
