Restrained bondage number of a graph
R. Kala, T. R. Nirmala Vasantha · Journal of Discrete Mathematical Sciences and Cryptography · 2009
The restrained bondage number of a graph G denoted by br (G) is the least positive integer k such that there exists F C E(G) with |F| = k and γ r (G \ F) > γ r (G). In this paper we define restrained bondage number br (G) and initiate a study of this parameter. We obtain br (G) for various classes of graphs, certain bounds for br (G) and attain the sharpness for these bounds. We also define uniform restrained bondage number bur (G) and derive few results for bur (G).