We give a combinatorial proof and an extension of the identity for the probability density of the cover time of a random walk on a finite graph obtained in [10] by considering it as the Möbius inversion formula. In addition, we obtain a similar identity for the cover time of multiple random walks.
