SPLIT BLOCK DOMINATION IN GRAPHS
M. H. Muddebihal · International Journal of Research in Engineering and Technology · 2013
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 split block dominating set if the induced sub graph 〈 − 〉 is disconnected .The split block domination number of is the minimum cardinality of split block dominating set of . In this paper many bounds on are obtained in terms of elements of but not the elements of . Also its relation with other domination parameters is established.