Reconstructing a graph from the boundary distance matrix
From MaRDI portal
Cites work
- A method for the linear recording of graphs
- A note on the metric properties of trees
- A note on the tree realizability of a distance matrix
- Boundary rigidity with partial data
- Boundary vertices in graphs
- Constructing street networks from GPS trajectories
- Distance matrix of a graph and its realizability
- Filling Riemannian manifolds
- Graph reconstruction and verification
- Graph reconstruction by discrete Morse theory
- Graphs with small boundary
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- Inverse problems: seeing the unseen
- On geodetic sets formed by boundary vertices
- On Metric Generators of Graphs
- On metric properties of certain clique graphs
- On the Addressing Problem for Loop Switching
- On the Metric Dimension of Cartesian Products of Graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- Phylogenetic graph models beyond trees
- Some structural, metric and convex properties of the boundary of a graph
- Sur la rigidite imposee par la longueur des geodesiques
- The boundary of a graph and its isoperimetric inequality
- The inertia and energy of the distance matrix of a connected graph
- The strong metric dimension of graphs and digraphs
- Two dimensional compact simple Riemannian manifolds are boundary distance rigid
This page was built for publication: Reconstructing a graph from the boundary distance matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950200)
