Our object is to introduce eg(G), the e-mail gossip number of a connec
ted graph G, and derive a simple equation expressing this new invarian
t in terms of the known [1] connected domination number cd(G). As a co
rollary we see that determining each of these numbers is NP-hard. In g
eneral we follow the graph theoretic notation and terminology of [2].
Throughout G = (V, E) is a connected graph with \V\ = n nodes.