An upper bound on the cover time for powers of graphs

DOI10.1016/S0012-365X(00)00013-3zbMath0998.05035WikidataQ127976952 ScholiaQ127976952MaRDI QIDQ1579561

Johan Jonasson

Publication date: 14 September 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundrandom walkCartesian product graphcover time

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (2)

Hitting times for random walks on tricyclic graphs ⋮ The Cover Time of Cartesian Product Graphs

This page was built for publication: An upper bound on the cover time for powers of graphs