pith. sign in

arxiv: 1810.06182 · v1 · pith:7KTZ2VODnew · submitted 2018-10-15 · 🧮 math.CO

Squared distance matrix of a weighted tree

classification 🧮 math.CO
keywords deltamatrixdistanceformulasquaredtreeassignedcase
0
0 comments X
read the original abstract

Let $T$ be a tree with vertex set $\{1, \ldots, n\}$ such that each edge is assigned a nonzero weight. The squared distance matrix of $T,$ denoted by $\Delta,$ is the $n \times 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 $\Delta.$ A formula for $\Delta^{-1}$ is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.