On distance matrices and Laplacians

143 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A q-analogue of the distance matrix of a tree (2006, unknown): “Mathematics Subject Classification: Primary: 05C50 Secondary: 15A15.”
On Euclidean distance matrices (2007, background): “If L is the Laplacian matrix of an arbitrary connected graph, then it was shown in [1] that (D − L) is a nonnegative matrix.”
Inverse statistical problems: from the inverse Ising problem to data science (2017, background): “In graph theory, this formula can be related to the expression for the distance in a tree whose links carry weights specified by pair correlations between spin pairs [15].”
On Distance Spectral Radius and Distance Energy of Graphs (2011, background): “Recall that trees [24], connected unicyclic graphs [25], and Kn have exactly one positive D-eigenvalue.”
Distance spectral radius of trees with fixed maximum degree (2010, unknown): “Let T be a tree with n > 2 vertices, and let Λ1 ≥ Λ2 ≥ · · · ≥ Λn be the eigenvalues of D = D(T ) arranged in a non-increasing order.”