Domination Integrity of Splitting Graph of Path and Cycle
Samir K. VAIDYA, Nirang J. Kothari · ISRN Combinatorics · 2013
If is a dominating set of a connected graph then the domination integrity is the minimum of the sum of two parameters, the number of elements in and the order of the maximum component of . We investigate domination integrity of splitting graph of path and cycle . This work is an effort to relate network expansion and vulnerability parameter.