Abstract
The anti-forcing number of a perfect matching M of a graph G is the minimal number of edges of G not in M whose deletion results in a subgraph with a ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
