Abstract
The l-fault-diameter of a graph G is the minimum d such that the diameter of G - X is at most d for any subset X of V(G) of size vertical bar X vertic......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
