CYCLIC GOSSIPING TIMES FOR SOME CLASSES OF GRAPHS

Gossiping and broadcasting are two problems of information disseminati on described for a group of individuals connected by a communication n etwork. In gossiping, every, person in the network knows a unique item of information and needs to communicate it to everyone else. In broad casting, one individual has an item of information which needs to be c ommunicated to everyone else. A variation of gossiping, called cyclic gossiping, recently introduced by Liestman and Richards, is studied he re for certain classes of graphs. (C) 1996 John Wiley & Sons, Inc.