On distance and Laplacian matrices of trees with matrix weights

Fouzul Atik, M. Rajesh Kannan, R. B. Bapat

The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $…