A note on graphs with diameter-preserving spanning trees

DOI10.1002/JGT.3190120408MaRDI QIDQ3807228zbMATH OpenOpenAlexFDO

Authors Fred Buckley, Martin Lewinter

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120408

zbMATH Keywords

adjacent central verticesconnected graphdiameter preserving spanning treedistance between verticeseccentricity of a vertexspannig tree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• Eccentricity-approximating trees in chordal graphs
• scientific article; zbMATH DE number 1043912
• Diameter-preserving spanning trees in sparse weighted graphs
• scientific article; zbMATH DE number 1034101
• Eccentric graphs

Cited in

(5)

• Spanning trees with disjoint dominating and 2-dominating sets
• Graph diameter, eigenvalues, and minimum-time consensus
• Solutions of a problem of Ore on spanning trees and its generalization
• scientific article; zbMATH DE number 4010534 (Why is no real title available?)
• Diameter-preserving spanning trees in sparse weighted graphs

This page was built for publication: A note on graphs with diameter-preserving spanning trees

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