Abstract
A [1, 2]-set S in a graph G is a vertex subset such that each vertex not in S has at least one and at most two neighbors in it. If the additional requ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
