Abstract
For a given graph G = (V, E), its integrity is defined as I(G) = min(X subset of V) {|X|+m(G-X)}, where m(G-X) denote the order of the largest compone......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
