Minimum broadcast tree decompositions

Recursive constructions for decomposing the complete directed graph DnDn into minimum broadcast trees of order nn are given, thereby showing the existence of such decompositions for all nn. Such decompositions can be used for a routing system in a network where every participant has the ability to broadcast a message to the group; as each arc is used in only one tree, a participant’s further actions upon receipt of a message depend only on its sender, and so all routing information can be stored locally rather than in the message itself.