Pages that link to "Item:Q2404178"
From MaRDI portal
The following pages link to Decomposing hitting times of walks on graphs into simpler ones (Q2404178):
Displayed 10 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)
- On the equivalence of cylinder tilings and planar electric networks (Q2192134) (← links)
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← 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)