English

Squared distance matrices of trees with matrix weights

Combinatorics 2022-05-05 v1

Abstract

Let TT be a tree on nn vertices whose edge weights are positive definite matrices of order ss. The squared distance matrix of TT, denoted by Δ\Delta, is the ns×nsns \times ns block matrix with Δij=d(i,j)2\Delta_{ij}=d(i,j)^2, where d(i,j)d(i,j) is the sum of the weights of the edges in the unique (i,j)(i,j)-path. In this article, we obtain a formula for the determinant of Δ\Delta and find Δ1{\Delta}^{-1} under some conditions.

Keywords

Cite

@article{arxiv.2205.01734,
  title  = {Squared distance matrices of trees with matrix weights},
  author = {Iswar Mahato and M. Rajesh Kannan},
  journal= {arXiv preprint arXiv:2205.01734},
  year   = {2022}
}

Comments

Preliminary version. Comments are welcome. 17 pages

R2 v1 2026-06-24T11:06:20.730Z