  We introduce a cover time problem for random walks on dynamic graphs in which
the graph expands in time and the walker moves at random times. Time to cover
all nodes and number of returns to original states are analyzed in resulting
model.
