Abstract
If a graph with non-zero edge weights has a non-singular adjacency matrix, one may use the inverse matrix to define a (weighted) graph that may be vie......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
