Document Type

Article

Publication Date

1997

Abstract

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.

Comments

This article was published in Graph Theory Notes of New York, volume 33, 1997. It is included here with the journal's permission.

Share

COinS