Abstract
The distance Laplacian matrix L(G) of a connected graph G is defined to be L(G) = diag(Tr) - D(G), where D(G) denotes the distance matrix of G and dia......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
