Article Type
Research Article
Publication Title
Electronic Journal of Graph Theory and Applications
Abstract
Let T be a tree with vertex set f1;: :: ; ng such that each edge is assigned a nonzero weight. The squared distance matrix of T; denoted by is the n 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.
First Page
301
Last Page
313
DOI
10.5614/ejgta.2019.7.2.8
Publication Date
1-1-2019
Recommended Citation
Bapat, Ravindra B., "Squared distance matrix of a weighted tree" (2019). Journal Articles. 1014.
https://digitalcommons.isical.ac.in/journal-articles/1014
Included in
Algebraic Geometry Commons, Discrete Mathematics and Combinatorics Commons, Numerical Analysis and Scientific Computing Commons, Theory and Algorithms Commons
Comments
Open Access, Gold, Green