Submatrices of non-tree-realizable distance matrices

DOI10.1016/0024-3795(82)90001-5zbMath0483.05045OpenAlexW2090136731MaRDI QIDQ1163034

Christina Maria Zamfirescu, J. M. S. Simões-Pereira

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90001-5

zbMATH Keywords

distance matrixoptimal realizationssubmatrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)

Related Items (19)

Reconstruction of graphs based on random walks ⋮ On optimal realizations of finite metric spaces by graphs ⋮ A fast algorithm for constructing trees from distance matrices ⋮ An algorithm for tree-realizability of distance matrices^∗ ⋮ A note on distance matrices with unicyclic graph realizations ⋮ An algorithm and its role in the study of optimal graph realizations of distance matrices ⋮ A canonical decomposition theory for metrics on a finite set ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ Distance spectra of graphs: a survey ⋮ A note on convexity and submatrices of distance matrices ⋮ An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ Unnamed Item ⋮ Recognizing and realizing cactus metrics ⋮ Trees related to realizations of distance matrices ⋮ 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 ⋮ Distance realization problems with applications to internet tomography

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the metric properties of trees
• The structure of distances in networks
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• The distance matrix of a graph and its tree realization
• Diagonal tree codes
• Distance matrix of a graph and its realizability
• Properties of the distance matrix of a tree
• A note on the tree realizability of a distance matrix

This page was built for publication: Submatrices of non-tree-realizable distance matrices