Abstract: In this paper, we define a model of random dynamical systems(RDS) on graphs and prove that they are actually homogeneous discrete-time Markov chains. Moreover, a necessary and suffcient condition is obtained for that two state vectors can communicate with each other in a random dynamical system(RDS).

Key words: random dynamical system(RDS), Markov chain, communicate