Abstract

AbstractBroadcasting is a basic problem of communication in usual networks. Many papers have investigated the construction of minimum broadcast networks, the cheapest possible network architecture (having the fewest communication lines), in which broadcasting can be accomplished as fast as theoretically possible from any vertex. Other papers considered the problem of determining the minimum broadcast time of a given vertex in an arbitrary network. In this paper, for given n we construct optimal networks on n vertices which we define to be the product of the broadcast time and the number of edges of the network. On the way we start the study of an interesting problem, the problem of minimum time broadcasting in networks with given number of vertices and edges.KeywordsBroadcastminimum broadcast graphoptimal networks

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.