Inverse of the distance matrix of a block graph
Inverse of the distance matrix of a block graph
复制标题
DOI：
10.1080/03081087.2011.557374
复制
发表时间：
2011-04
影响因子：
1.1
通讯作者：
R. Bapat;S. Sivasubramanian
中科院分区：
文献类型：
--
作者：
R. Bapat;S. Sivasubramanian
一个连通图G，其2个连通的块都是团（可能大小不一），称为块图。设D是它的距离矩阵。根据Graham， Hoffman和Hosoya的定理，det(D)≠0。我们给出了D的行列式和逆矩阵D - 1的公式。
A connected graph G, whose 2-connected blocks are all cliques (of possibly varying sizes) is called a block graph. Let D be its distance matrix. By a theorem of Graham, Hoffman and Hosoya, we have det(D) ≠ 0. We give a formula for both the determinant and the inverse, D −1 of D.