{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T04:41:26Z","timestamp":1694666486923},"reference-count":36,"publisher":"Wiley","issue":"16","license":[{"start":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T00:00:00Z","timestamp":1430265600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"NSERC Canada"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2015,11]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Hyper\u2010star graph <jats:italic>H<\/jats:italic><jats:italic>S<\/jats:italic>(2<jats:italic>n<\/jats:italic>,<jats:italic>n<\/jats:italic>) 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 <jats:italic>H<\/jats:italic><jats:italic>S<\/jats:italic>(2<jats:italic>n<\/jats:italic>,<jats:italic>n<\/jats:italic>), (2) discussing its Hamiltonicity by establishing an isomorphism between the graph and the well\u2010known middle levels problem, and (3) showing that full binary trees can be embedded into <jats:italic>H<\/jats:italic><jats:italic>S<\/jats:italic>(2<jats:italic>n<\/jats:italic>,<jats:italic>n<\/jats:italic>) with dilation 1. We also develop a single\u2010port optimal neighbourhood broadcasting algorithm for <jats:italic>H<\/jats:italic><jats:italic>S<\/jats:italic>(2<jats:italic>n<\/jats:italic>,<jats:italic>n<\/jats:italic>). Copyright \u00a9 2015 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/cpe.3503","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T23:48:20Z","timestamp":1430351300000},"page":"4186-4193","source":"Crossref","is-referenced-by-count":2,"title":["Hyper\u2010star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm"],"prefix":"10.1002","volume":"27","author":[{"given":"F.","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Computer Science Brock University  St. Catharines Ontario Canada"}]},{"given":"K.","family":"Qiu","sequence":"additional","affiliation":[{"name":"Department of Computer Science Brock University  St. Catharines Ontario Canada"}]},{"given":"J. S.","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Physics North Carolina Central University  Durham NC USA 27707"}]}],"member":"311","published-online":{"date-parts":[[2015,4,29]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"e_1_2_8_3_1","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton T","year":"1992"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.330"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.205649"},{"key":"e_1_2_8_8_1","unstructured":"AkersSB HarelD KrishnamurthyB.The star graph: An attractive alternative to the n\u2010cube.Proceedings of the International Conference on Parallel Processing University Park PA USA 1987;393\u2013400."},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"e_1_2_8_10_1","doi-asserted-by":"crossref","unstructured":"LeeHO KimJS OhE LimHS.Hyper\u2010star graph: a new interconnection network improving the network cost of hypercube.Proceedings of EurAsia ICT: Information and Communication Technology LNCS 2510 Shiraz Iran 2002;858\u2013865.","DOI":"10.1007\/3-540-36087-5_99"},{"key":"e_1_2_8_11_1","first-page":"65","article-title":"Structural properties of hyper\u2010stars","volume":"80","author":"Cheng E","year":"2006","journal-title":"Ars Combinatoria"},{"key":"e_1_2_8_12_1","first-page":"181","article-title":"A strong structural theorem for hyper\u2010stars","volume":"179","author":"Cheng E","year":"2006","journal-title":"Congressus Numerantium"},{"key":"e_1_2_8_13_1","doi-asserted-by":"crossref","unstructured":"KimJS OhE LeeHO HeoYN.Topological and communication aspects of hyper\u2010star graphs.Proceedings of the 18th International Symposium on Computer and Information Sciences LNCS 2869 Antalya Turkey 2003;51\u201358.","DOI":"10.1007\/978-3-540-39737-3_7"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160701691431"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207160903501925"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0538-4"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.04.006"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20389"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1414"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(13)80127-8"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.08.007"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2005.09.004"},{"key":"e_1_2_8_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626411000072"},{"key":"e_1_2_8_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-011-0641-1"},{"key":"e_1_2_8_25_1","unstructured":"FertinG RaspaudA.k\u2010Neighbourhood broadcasting.Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO'01) Barcelona Spain 2001;133\u2013146."},{"key":"e_1_2_8_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00294-4"},{"key":"e_1_2_8_27_1","unstructured":"SloaneNJA.The On\u2010Line Encyclopedia of Integer Sequences. (Available from:http:\/\/oeis.org)."},{"key":"e_1_2_8_28_1","first-page":"1","article-title":"On integer\u2010sequence\u2010based constructions of generalized Pascal triangles","volume":"9","author":"Barry P","year":"2006","journal-title":"Journal of Integer Sequences"},{"key":"e_1_2_8_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90091-8"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.010"},{"key":"e_1_2_8_31_1","unstructured":"MadabhushiS LakshmivarahanS DhallS.Analysis of the modified even networks.Technical Report School of Electrical Engineering and Computer Science University of Oklahoma 1990."},{"key":"e_1_2_8_32_1","unstructured":"WestDB.Revolving door (middle levels) conjecture. (Available from:http:\/\/www.math.uiuc.edu\/~west\/openp\/revolving.html.)"},{"key":"e_1_2_8_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322401"},{"key":"e_1_2_8_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/040617716"},{"key":"e_1_2_8_35_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626491000057"},{"key":"e_1_2_8_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265903000957"},{"key":"e_1_2_8_37_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407003137"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.3503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.3503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T11:59:56Z","timestamp":1694606396000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.3503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,29]]},"references-count":36,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.1002\/cpe.3503"],"URL":"https:\/\/doi.org\/10.1002\/cpe.3503","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,29]]}}}