Abstract
The matching preclusion number of a graph G, denoted by mp(G), is the minimum number of edges whose deletion results in a graph that has neither perfe......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
