Diameter of random spanning trees in a given graph

DOI10.1002/JGT.20577MaRDI QIDQ2891037zbMATH OpenOpenAlexFDO

Authors Paul Horn, Linyuan Lu, Fan Chung

Publication date 13 June 2012

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

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

zbMATH Keywords

random walksspanning trees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• The diameter of the uniform spanning tree of dense graphs
• The diameter of sparse random graphs
• The diameter of uniform spanning trees in high dimensions
• The diameter of sparse random graphs
• The diameter of sparse random graphs

Cites work

• Connected components in random graphs with given expected degree sequences
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• On the height of trees
• Spectra of random graphs with given expected degrees
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

Cited in

(6)

• The diameter of uniform spanning trees in high dimensions
• Random-tree diameter and the diameter-constrained MST
• Random-tree Diameter and the Diameter-constrained MST
• The diameter of sparse random graphs
• The diameter of the uniform spanning tree of dense graphs
• Diameter of uniform spanning trees on random weighted graphs

This page was built for publication: Diameter of random spanning trees in a given graph

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