Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix

DOI10.1007/BF01139951zbMath0561.05041MaRDI QIDQ2266027

S. V. Yushmanov

Publication date: 1984

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

distance matrixreconstruction of treesterminal vertices

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Representations of graphs and networks (coding, layouts and embeddings) ⋮ Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• A note on the metric properties of trees
• Distance matrix of a graph and its realizability
• A note on the tree realizability of a distance matrix
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix