
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 $��,$ 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 $��.$ A formula for $��^{-1}$ is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.
tree, distance matrix, squared distance matrix, determinant, inverse, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics
tree, distance matrix, squared distance matrix, determinant, inverse, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
