Distance defined by spanning trees in graphs

DOI10.7151/DMGT.1375MaRDI QIDQ3504801zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Ladislav Nebeský, Ping Zhang

Publication date 18 June 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b7c14c3a7e2fd1e8529173383b8ee9f02812de87

zbMATH Keywords

\(T\)-distance\(T\)-geodesic\(T\)-pathdistancegeodesic

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• scientific article; zbMATH DE number 1052827
• Distance approximating spanning trees
• Distance approximating trees in graphs
• On the maximal distance of spanning trees
• Spanning trees with leaf distance at least \(d\)
• Average distance, minimum degree, and spanning trees
• Distance in graphs
• scientific article; zbMATH DE number 194437
• Publication:4887691
• On distances in vertex-weighted trees

Cited in

(1)

• Guides and shortcuts in graphs

This page was built for publication: Distance defined by spanning trees in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3504801)