Distance matrix of a graph and its realizability
From MaRDI portal
Publication:5329581
Cited in
(55)- Submatrices of non-tree-realizable distance matrices
- Extremal properties of the distance spectral radius of hypergraphs
- Free trees and bidirectional trees as representations of psychological distance
- Tree representations of ternary relations
- Treelike families of multiweights
- Graph theoretic foundations of pathfinder networks
- Underlying graph and total length of optimal realizations of variable distance matrices
- Reconstruction of graphs based on random walks
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- A fast backtrack algorithm for graph isomorphism
- Injective optimal realizations of finite metric spaces
- The metric cutpoint partition problem
- Relaxed and approximate graph realizations
- Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
- On optimal embeddings of metrics in graphs
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii
- A Calderón type inverse problem for tree graphs
- A tropical interpretation of \(m\)-dissimilarity maps
- On graphlike \(k\)-dissimilarity vectors
- Searching for realizations of finite metric spaces in tight spans
- Computational complexity of inferring phylogenies from dissimilarity matrices
- A fast algorithm for constructing trees from distance matrices
- A constructive algorithm for realizing a distance matrix
- Level-\(2\) networks from shortest and longest distances
- Optimal realizations and the block decomposition of a finite metric space
- A note on distance matrices with unicyclic graph realizations
- scientific article; zbMATH DE number 6857397 (Why is no real title available?)
- Distance realization problems with applications to internet tomography
- Distance conserving reductions for nonoriented networks
- Reconstructing trees from subtree weights.
- Trees related to realizations of distance matrices
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- Distance spectra of graphs: a survey
- Some personal views on the current state and the future of locational analysis
- On optimal realizations of finite metric spaces by graphs
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Weighted graphs with distances in given ranges
- Distance matrices on the \textit{H-join} of graphs: a general result and applications
- Graph realization of distance sets
- Vertex-weighted graphs: realizable and unrealizable domains
- A note on tree realizations of matrices
- Moduli space of families of positive \((n - 1)\)-weights
- Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix
- Minimal networks: a review
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- Optimal realizations of two-dimensional, totally-decomposable metrics
- Closeness centrality reconstruction of tree graphs
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- Recognizing and realizing cactus metrics
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- On the weights of simple paths in weighted complete graphs
- Smith normal form of a distance matrix inspired by the four-point condition
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Metrics on spaces of finite trees
This page was built for publication: Distance matrix of a graph and its realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5329581)
