Distance matrix of a graph and its realizability

DOI10.1090/qam/184873zbMath0125.11804OpenAlexW174827889MaRDI QIDQ5329581

S. Louis Hakimi, Stephen S. Yau

Publication date: 1965

Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/qam/184873

zbMATH Keywords

topology

Related Items

A Calderón type inverse problem for tree graphs, Reconstruction of graphs based on random walks, Computational complexity of inferring phylogenies from dissimilarity matrices, Unnamed Item, Underlying graph and total length of optimal realizations of variable distance matrices, On optimal realizations of finite metric spaces by graphs, Graph theoretic foundations of pathfinder networks, Weighted graphs with distances in given ranges, Vertex-weighted graphs: realizable and unrealizable domains, A fast backtrack algorithm for graph isomorphism, A constructive algorithm for realizing a distance matrix, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, A fast algorithm for constructing trees from distance matrices, Distance conserving reductions for nonoriented networks, A note on distance matrices with unicyclic graph realizations, On the weights of simple paths in weighted complete graphs, On graphlike \(k\)-dissimilarity vectors, Injective optimal realizations of finite metric spaces, Smith normal form of a distance matrix inspired by the four-point condition, Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances, A note on tree realizations of matrices, An algorithm and its role in the study of optimal graph realizations of distance matrices, Minimal Networks: A Review, Submatrices of non-tree-realizable distance matrices, New bounds on the distance Laplacian and distance signless Laplacian spectral radii, Level-\(2\) networks from shortest and longest distances, 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, Reconstructing trees from subtree weights., Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix, Free trees and bidirectional trees as representations of psychological distance, Distance matrices on the \textit{H-join} of graphs: a general result and applications, The metric cutpoint partition problem, Searching for realizations of finite metric spaces in tight spans, Tree representations of ternary relations, Optimal realizations and the block decomposition of a finite metric space, Composed degree-distance realizations of graphs, Recognizing and realizing cactus metrics, Composed degree-distance realizations of graphs, Unnamed Item, Metrics on spaces of finite trees, A tropical interpretation of \(m\)-dissimilarity maps, Treelike families of multiweights, Moduli space of families of positive \((n - 1)\)-weights, Some personal views on the current state and the future of locational analysis, 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, Optimal realizations of two-dimensional, totally-decomposable metrics, Distance realization problems with applications to internet tomography, Relaxed and approximate graph realizations