Abstract
Given a positive integer k and a graph G, a k-limited packing in G is a subset B of its vertex set such that each closed vertex neighborhood of G has ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
