Please use this identifier to cite or link to this item:
|Title:||Inverse of the distance matrix of a block graph|
|Publisher:||TAYLOR & FRANCIS LTD|
|Citation:||LINEAR & MULTILINEAR ALGEBRA,59(12)1393-1397|
|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) not equal 0. We give a formula for both the determinant and the inverse, D(-1) of D.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.