论文部分内容阅读
The bondage number of γf, bf(G) , is defined to be the minimum cardinality of a set of edges whose removal from G results in a graph G′ satisfying γf(G′)＞γf(G). The reinforcement number of γf, rf(G), is defined to be the minimum cardinality of a set of ed