CO- Total 2- Oded Number in Graphs

Abstract

Let D be a subset of V and  the out degree of u is defined by ) and denoted by A dominating set D of V is said to be co- total dominating set if the sub graph induced  by  has no isolated vertices Based on the concepts we introduce a new domination called co-total 2 - ODED number. Here the proposed domination number verified for some general and some named graphs.