The e-mail gossip number and the connected domination number Original Research Article

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