Inverse of the distance matrix of a block graph
- 20 April 2011
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 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) ≠ 0. We give a formula for both the determinant and the inverse, D −1 of D.Keywords
This publication has 4 references indexed in Scilit:
- -Analogs of distance matrices of 3-hypertreesLinear Algebra and its Applications, 2009
- A q-analogue of the distance matrix of a treeLinear Algebra and its Applications, 2006
- Distance matrix polynomials of treesAdvances in Mathematics, 1978
- On the distance matrix of a directed graphJournal of Graph Theory, 1977