Graph Theory Notes of New York
Suppose two particles occupy distinct vertices of a wheel graph and at each step the two particles move independently to adjacent vertices. In this paper we find the expected number of moves until the particles land on the same vertex.
Matthew Lee and Mark Stamp. "Random walks on wheels" Graph Theory Notes of New York (1997): 24-25.