The expected hitting times for finite Markov chains

In this paper, using the theory of matrix algebra, we obtain a new expression for the expected hitting times of irreducible aperiodic Markov chains. Then, using it, we calculate the expected hitting times of random walks on several kinds of graphs. These examples show that in many cases our approach is better than the others.