On the Mean and Variance of Cover Times for Random Walks on Graphs

A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide results for vertex symmetric graphs. Some examples are given