Bapat, R. B. ; Sivasubramanian, Sivaramakrishnan (2011) Inverse of the distance matrix of a block graph Linear and Multilinear Algebra, 59 (12). pp. 1393-1397. ISSN 0308-1087
Full text not available from this repository.
Official URL: http://www.tandfonline.com/doi/abs/10.1080/0308108...
Related URL: http://dx.doi.org/10.1080/03081087.2011.557374
Abstract
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Taylor and Francis Group. |
| Keywords: | Distance Matrix; Determinant; Laplacian Matrix |
| ID Code: | 81605 |
| Deposited On: | 07 Feb 2012 05:14 |
| Last Modified: | 07 Feb 2012 05:14 |
Repository Staff Only: item control page
