Abstract
This paper studies the hierarchical broadcast networks, which are defined as broadcast networks whose every connected induced subgraph is also a broadcast network. We show that the minimum number of edges of a hierarchical broadcast network of order n is ⌈ n(n − 2) 2 ⌉ for any n ⩾ 4.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
