Abstract
A well-partitioned graph is defined as a graph G(V, E) in which every partition of vertex set V, say, Pi = {P-1 , ..., P-k}, is an equitable partition......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
