{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:07Z","timestamp":1759063447172},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2002,3]]},"abstract":"<jats:p> Arrangement graphs<jats:sup>14<\/jats:sup> and (n, k)-star graphs<jats:sup>11<\/jats:sup> were introduced as generalizations of star graphs<jats:sup>1<\/jats:sup>. They were introduced to provide a wider set of choices for the order of topologically attractive interconnection networks. Unidirectional interconnection networks are more appropriate in many applications. Cheng and Lipman<jats:sup>5<\/jats:sup>, and Day and Tripathi<jats:sup>17<\/jats:sup> studied the unidirectional star graphs, and Cheng and Lipman<jats:sup>7<\/jats:sup> studied orientation of arrangement graphs. In this paper, we show that every (n, k)-star graph can be oriented to a maximally arc-connected graph when the regularity of the graph is even. If the regularity is odd, then the resulting directed graph can be augmented to a maximally arc-connected directed graph by adding a directed matching. In either case, the diameter of the resulting directed graph is small. Moreover, there exists a simple and near-optimal routing algorithm. <\/jats:p>","DOI":"10.1142\/s0219265902000525","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T02:22:20Z","timestamp":1032229340000},"page":"19-34","source":"Crossref","is-referenced-by-count":16,"title":["UNIDIRECTIONAL (n, k)-STAR GRAPHS"],"prefix":"10.1142","volume":"03","author":[{"given":"EDDIE","family":"CHENG","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics,  Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARC J.","family":"LIPMAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics,  Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,8]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00005"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00155-6"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(200003)35:2<139::AID-NET4>3.0.CO;2-E"},{"key":"p_7","first-page":"97","volume":"142","author":"Cheng E.","year":"2000","journal-title":"Gongressus Numerantium"},{"key":"p_9","first-page":"107","volume":"59","author":"Cheng E.","year":"2001","journal-title":"Ars Combinatoria"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00162-1"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00052-0"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"p_15","first-page":"1002","volume":"12","author":"Day K.","year":"1992","journal-title":"IEEE Trans, on Computers"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90013-Y"},{"key":"p_18","first-page":"35","volume":"25","author":"Day K.","year":"1998","journal-title":"Kuwait J. Sci. & Eng."},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1109\/71.755822"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<307::AID-NET7>3.0.CO;2-5"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1960-049-6"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265902000525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:16:17Z","timestamp":1565111777000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265902000525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":14,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2012,4,8]]},"published-print":{"date-parts":[[2002,3]]}},"alternative-id":["10.1142\/S0219265902000525"],"URL":"https:\/\/doi.org\/10.1142\/s0219265902000525","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}