Cototal block domination in graphs
M. H. Muddebihal, P. Shekanna, Shabbir Ahmed · International Journal of Management, IT, and Engineering · 2014
For any graph block graph is a graph whose set of vertices is the union of the set of blocks of in which two vertices are adjacent if and only if the corresponding blocks of are adjacent. A dominating set of a graph is a cototal block dominating set if the induced subgraph has no isolated vertices. The cototal block domination number is the minimum cardinality of a co total block dominating set of In this paper many bounds on are obtained interms of elements of but not the elements of Also its relation with other domination parameters were established.