Abstract
A simple random walk on a graph is a sequence of movements from a vertex to an adjacent vertex in such that each step is chosen uniformly randomly distributed across the neighborhood of the current vertex. The cover time of a random walk is the first moment where each vertex of the graph was visited. We are interested on the expected time for the cover time of specific families of graphs.…