Cyclic gossiping times for some classes of graphs

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individual has an item of information which needs to be communicated to everyone else. A variation of gossiping, called cyclic gossiping, recently introduced by Liestman and Richards, is studied here for certain classes of graphs.