{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:23:20Z","timestamp":1648571000745},"reference-count":22,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:p> The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper. <\/jats:p>","DOI":"10.1142\/s021926590400126x","type":"journal-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T15:45:50Z","timestamp":1107099950000},"page":"475-487","source":"Crossref","is-referenced-by-count":0,"title":["TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS"],"prefix":"10.1142","volume":"05","author":[{"given":"LU","family":"RUAN","sequence":"first","affiliation":[{"name":"Department of Computer Science, Iowa State University, Ames, IA 50011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHITOU","family":"HAN","sequence":"additional","affiliation":[{"name":"Oracle Corp., 500 Oracle Parkway, Redwood Shores, CA 94065, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DEYING","family":"LI","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HUNG Q.","family":"NGO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, State University of New York at Buffalo, Amherst, NY 14260, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SCOTT C.-H.","family":"HUANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","first-page":"3","volume":"61","author":"Balbuena C.","journal-title":"Ars Combin."},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00383-1"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788663"},{"key":"rf4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.11650\/twjm\/1500407128","volume":"3","author":"Cao F.","journal-title":"Taiwanese J. Math."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00079-4"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00282-2"},{"key":"rf7","unstructured":"N.\u00a0De Bruijn, Koninklijke Nederlandse Academie van Wetenschappen Proc.\u00a0A49 (1946)\u00a0pp. 758\u2013764."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180105"},{"key":"rf9","first-page":"612","volume":"42","author":"Du D. Z.","journal-title":"IEEE Trans. Comput."},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130603"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00240-4"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140608"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676455"},{"key":"rf14","volume-title":"Handbook of Graph Theory","author":"Gross J. L.","year":"2004"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/12.8718"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1002\/scj.4690170803"},{"key":"rf18","unstructured":"W.\u00a0Kautz, Theory of Cellular Logic Networks and Machines, AFCRL-68-0668 Final Report (1968)\u00a0pp. 20\u201328."},{"key":"rf19","unstructured":"V.\u00a0Kumar and S.\u00a0Reddy, IEEE 1984 Int. Conf. Distributed Computing Systems (1984)\u00a0pp. 448\u2013460."},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00127-Y"},{"key":"rf21","unstructured":"S.\u00a0Reddy, Proc. of 20-th Annual Allerton Conference (1982)\u00a0pp. 1018\u20131026."},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90155-4"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021926590400126X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:34:48Z","timestamp":1565148888000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021926590400126X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":22,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1142\/S021926590400126X"],"URL":"https:\/\/doi.org\/10.1142\/s021926590400126x","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}