Trees related to realizations of distance matrices

DOI10.1016/S0012-365X(98)00081-8zbMath0955.05070OpenAlexW2121184236MaRDI QIDQ1584445

Sacha C. Varone

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00081-8

zbMATH Keywords

treedistance matrix

Mathematics Subject Classification ID

Trees (05C05) Metric spaces, metrizability (54E35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

A constructive algorithm for realizing a distance matrix ⋮ A note on tree realizations of matrices ⋮ New bounds on the distance Laplacian and distance signless Laplacian spectral radii ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Distance spectra of graphs: a survey ⋮ Distance matrices on the \textit{H-join} of graphs: a general result and applications

Cites Work

• Unnamed Item
• On optimal embeddings of metrics in graphs
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A fast algorithm for constructing trees from distance matrices
• Submatrices of non-tree-realizable distance matrices
• Free trees and bidirectional trees as representations of psychological distance
• A note on the metric properties of trees
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• Diagonal tree codes
• Distance matrix of a graph and its realizability
• A note on the tree realizability of a distance matrix

This page was built for publication: Trees related to realizations of distance matrices