The expected hitting times for graphs with cutpoints

It is well known that the computation of the expected hitting times for random walks on graphs with cutpoints can be broken into smaller tasks. In this paper, using the electrical network approach, we provide the explicit formulas of the expected hitting times for simple random walks (SRW) on trees and unicyclic graphs. Furthermore, we obtain that the expected hitting times for SRW on trees are natural numbers.Random walks The expected hitting time Effective resistance