Squared distance matrices of trees with matrix weights

preprint2022arXivOpen access

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 ΔΔ, is the ns×nsns \times ns block matrix with Δij=d(i,j)2Δ_{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 ΔΔ and find Δ−1Δ^{-1} under some conditions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.