Split bondage numbers of a graph
V. R. Kulli, B. Janakiram, Radha R. Iyer · Journal of Discrete Mathematical Sciences and Cryptography · 1998
Let G = (V, E) be a graph. The negative split bondage number of G is the minimum cardinality among all sets of edges X ⊂ E such that γ s (G − S) γ s (G), where γ s (G) is the split domination number of G. In this paper, we initiate a study of these two new parameters.