Diameter of random spanning trees in a given graph

DOI10.1002/jgt.20577zbMath1242.05254OpenAlexW1530007730MaRDI QIDQ2891037

Paul S. Horn, Linyuan Lu, Fan R. K. 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) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (1)

The diameter of uniform spanning trees in high dimensions

Cites Work

• Unnamed Item
• Connected components in random graphs with given expected degree sequences
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Spectra of random graphs with given expected degrees
• On the height of trees

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