Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees

Mikhail Goubko, Alexander Veremyev

It is known from the algebraic graph theory that if $L$ is the Laplacian matrix of some tree $G$ with a vertex degree sequence $\mathbf{d}=(d_1,...,d_n{)}^{\top }$ and $D$ is its dist…