Abstract
A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S has an in-neighbor in S. A dominating set S of D is called a......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
