Pages that link to "Item:Q5553122"
From MaRDI portal
The following pages link to Properties of the distance matrix of a tree (Q5553122):
Displaying 13 items.
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- Reconstruction of graphs based on random walks (Q837176) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- A fast algorithm for constructing trees from distance matrices (Q1116346) (← links)
- A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
- Submatrices of non-tree-realizable distance matrices (Q1163034) (← links)
- Distance realization problems with applications to internet tomography (Q1604199) (← links)
- Distance matrices on the \textit{H-join} of graphs: a general result and applications (Q1794312) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
- Maximizing the number of spanning trees on the (<i>p,</i><i>p</i>+2) graphs (Q4009724) (← links)
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii (Q5142111) (← links)
