Distance matrix of a multi-block graph: determinant and inverse
Linear & Multilinear Algebra(2022)
摘要
A connected graph is called a multi-block graph if each of its blocks is a complete multipartite graph. We consider the distance matrix of multi-block graphs with blocks whose distance matrices have nonzero cofactor. In this case, if the distance matrix of a multi-block graph is invertible, we find the inverse as a rank one perturbation of a multiple of a Laplacian-like matrix. We also provide the inverse of the distance matrix for a class of multi-block graphs in which the distance matrix of one of its block has zero cofactor.
更多查看译文
关键词
m-partite graphs, Laplacian-like matrix, distance matrix, determinant, cofactor
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要