Squared distance matrix of a weighted tree
Ravindra B. Bapat

TL;DR
This paper derives formulas for the determinant and inverse of the squared distance matrix of a weighted tree, generalizing known results from the unweighted case.
Contribution
It provides explicit formulas for the determinant and inverse of the squared distance matrix of weighted trees, extending previous unweighted results.
Findings
Derived a formula for the determinant of the squared distance matrix.
Obtained an explicit formula for the inverse of the squared distance matrix under certain conditions.
Generalized known formulas from unweighted to weighted trees.
Abstract
Let be a tree with vertex set such that each edge is assigned a nonzero weight. The squared distance matrix of denoted by is the matrix with -element where is the sum of the weights of the edges on the -path. We obtain a formula for the determinant of A formula for is also obtained, under certain conditions. The results generalize known formulas for the unweighted case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Advanced Graph Theory Research
