Abstract
SummaryHyper‐star graph HS(2n,n) was introduced to be a competitive model to both hypercubes and star graphs. In this paper, we study its properties by (1) giving a closed form solution to the surface area of HS(2n,n), (2) discussing its Hamiltonicity by establishing an isomorphism between the graph and the well‐known middle levels problem, and (3) showing that full binary trees can be embedded into HS(2n,n) with dilation 1. We also develop a single‐port optimal neighbourhood broadcasting algorithm for HS(2n,n). Copyright © 2015 John Wiley & Sons, Ltd.
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 callMore From: Concurrency and Computation: Practice and Experience
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.
