Total co-independent domination in graphs
N. D. Soner, B. V. Dhananjaya Murthy, G. Deepak · 2012
A set D of vertices in a graph G is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A dominating set D of a graph G is total dominating set if the induced subgraph �D� has no isolated vertices. In this paper, we introduce the total co-independent domination in graphs, exact value for some standard graphs, bounds and some results are established.