A note on convexity and submatrices of distance matrices

DOI10.1080/03081088708817769zbMath0626.05039OpenAlexW2056882583MaRDI QIDQ3029037

J. M. S. Simões-Pereira

Publication date: 1987

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088708817769

zbMATH Keywords

weighted graphdistance matrixnontree-realization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

An algorithm and its role in the study of optimal graph realizations of distance matrices

Cites Work

• On optimal embeddings of metrics in graphs
• 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

This page was built for publication: A note on convexity and submatrices of distance matrices