Hyper-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 giving a closed form solution to the surface area of HS(2n. n) and discussing its Hamiltonicity by establishing an isomorphism between the graph and the well known middle levels problem. We also develop a single-port optimal neighbourhood broadcasting algorithm for HS(2n,n).
展开▼
