Abstract
Let wG(u) be the sum of distances from u to all the other vertices of G. The Wiener complexity, CW(G), is the number of different values of wG(u) in G......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
