Abstract
A set S C V in a graph G -= (V, E) is called a dominating set if N[S] = V. The domination number -y(G) of G is the minimum cardinality of a dominating......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
