English

Squared distance matrix of a weighted tree

Combinatorics 2018-10-16 v1

Abstract

Let TT be a tree with vertex set {1,,n}\{1, \ldots, n\} such that each edge is assigned a nonzero weight. The squared distance matrix of T,T, denoted by Δ,\Delta, is the n×nn \times n matrix with (i,j)(i,j)-element d(i,j)2,d(i,j)^2, where d(i,j)d(i,j) is the sum of the weights of the edges on the (ij)(ij)-path. We obtain a formula for the determinant of Δ.\Delta. A formula for Δ1\Delta^{-1} is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.

Keywords

Cite

@article{arxiv.1810.06182,
  title  = {Squared distance matrix of a weighted tree},
  author = {Ravindra B. Bapat},
  journal= {arXiv preprint arXiv:1810.06182},
  year   = {2018}
}
R2 v1 2026-06-23T04:39:23.338Z