Squared distance matrix of a weighted tree
Electronic Journal of Graph Theory and Applications
Let T be a tree with vertex set f1;: :: ; ng such that each edge is assigned a nonzero weight. The squared distance matrix of T; denoted by is the n n matrix with (i; j)-element d(i; j)2; where d(i; j) is the sum of the weights of the edges on the (ij)-path. We obtain a formula for the determinant of A formula for 1 is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.
Bapat, Ravindra B., "Squared distance matrix of a weighted tree" (2019). Journal Articles. 1014.