Record Details

Inverse of the distance matrix of a block graph

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Inverse of the distance matrix of a block graph
 
Creator BAPAT, RB
SIVASUBRAMANIAN, S
 
Subject distance matrix
determinant
Laplacian matrix
 
Description 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.
 
Publisher TAYLOR & FRANCIS LTD
 
Date 2012-06-26T09:57:26Z
2012-06-26T09:57:26Z
2011
 
Type Article
 
Identifier LINEAR & MULTILINEAR ALGEBRA,59(12)1393-1397
0308-1087
http://dx.doi.org/10.1080/03081087.2011.557374
http://dspace.library.iitb.ac.in/jspui/handle/100/14345
 
Language English