Abstract
A set S of vertices in a graph G is a total dominating set of G if every vertex has a neighbor in S. The total domination number gamma(t)(G), is the m......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
