Abstract
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfec......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
