The bondage and reinforcement numbers of &ggr;f for some graphs
Discrete Mathematics
On the complexity of the bondage and reinforcement problems
Journal of Complexity
Hi-index | 0.04 |
In this note we prove a conjecture and improve some results presented in a recent paper of Sridharan et al. [N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202].