Pages that link to "Item:Q3008009"

The following pages link to A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs (Q3008009):

Displaying 13 items.

• Further results on the expected hitting time, the cover cost and the related invariants of graphs (Q1618224) (← links)
• The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
• Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
• An explicit formula of hitting times for random walks on graphs (Q2514190) (← links)
• Finding hitting times in various graphs (Q2637378) (← links)
• Hitting times for random walks on subdivision and triangulation graphs (Q4640054) (← links)
• Expected hitting times for random walks on quadrilateral graphs and their applications (Q4689926) (← links)
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters (Q4959293) (← links)
• The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
• Hitting times for random walks on tricyclic graphs (Q6166239) (← links)
• Random growth scale-free networked models with an identical degree distribution and a tunable assortativity index (Q6558034) (← links)
• On the weighted reverse cover cost of trees and unicyclic graphs with given diameter (Q6585505) (← links)