Abstract
A set D of vertices in a graph G is called a dissociation set if every vertex in D has at most one neighbor in D. We call a graph G uniformly dissocia......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
