Properties of the distance matrix of a tree
From MaRDI portal
Publication:5553122
DOI10.1090/qam/265210zbMath0167.52205OpenAlexW2563307704MaRDI QIDQ5553122
No author found.
Publication date: 1969
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/265210
Related Items (13)
Reconstruction of graphs based on random walks ⋮ On optimal realizations of finite metric spaces by graphs ⋮ A constructive algorithm for realizing a distance matrix ⋮ A fast algorithm for constructing trees from distance matrices ⋮ Maximizing the number of spanning trees on the (p,p+2) graphs ⋮ A note on distance matrices with unicyclic graph realizations ⋮ Submatrices of non-tree-realizable distance matrices ⋮ New bounds on the distance Laplacian and distance signless Laplacian spectral radii ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ Distance spectra of graphs: a survey ⋮ Distance matrices on the \textit{H-join} of graphs: a general result and applications ⋮ On optimal embeddings of metrics in graphs ⋮ Distance realization problems with applications to internet tomography
This page was built for publication: Properties of the distance matrix of a tree
