DOMINATION INTEGRITY OF SPLITTING AND DEGREE SPLITTING GRAPHS OF SOME GRAPHS
The domination integrity of a simple connected graph G is a measure of vulnerability of a graph and it is defined as is a dominating set} where is the order of a maximum component of Here we determine the domination integrity of splitting and degree splitting related graphs.
integrity, domination integrity, splitting graph, degree splitting of graph.