{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:12:32Z","timestamp":1648624352877},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0012-365x(97)00079-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"27-38","source":"Crossref","is-referenced-by-count":6,"title":["Super line-connectivity of consecutive-d digraphs"],"prefix":"10.1016","volume":"183","author":[{"given":"Feng","family":"Cao","sequence":"first","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]},{"given":"D.","family":"Frank Hsu","sequence":"additional","affiliation":[]},{"given":"Lihui","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00079-4_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB2","series-title":"Hypercube and Distributed Computers","first-page":"279","article-title":"de Bruijn and Kautz networks: a competitor for the hypercube?","author":"Bermond","year":"1989"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB3","series-title":"Proc. 19th Southeastern Conf. on Combinatorics, Graph Theory and Computing","article-title":"Broadcasing in de Bruijn networks","author":"Bermond","year":"1988"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB4","series-title":"French-Israel Conf. on Combinatorics","article-title":"Connectivity of Kautz networks","author":"Bermond","year":"1988"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB5","series-title":"Proc. 3rd Conf. of Program Designers","first-page":"75","article-title":"Modeling of interconnection networks using de Bruijn graphs","author":"Bond","year":"1987"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB6","first-page":"758","article-title":"A combinatorial problem, Koninklijke Nederlandse Academic van Wetenschappen","volume":"49","author":"de Bruijn","year":"1946"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB7","first-page":"1","article-title":"Diameter of communication networks","volume":"34","author":"Chung","year":"1986"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB8","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1109\/TC.1985.1676641","article-title":"Doubly-linked ring networks","volume":"C-34","author":"Du","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB9","series-title":"Combinatorics and Graph Theory","first-page":"47","article-title":"On hamiltonian consecutive-d digraphs","volume":"vol. 25","author":"Du","year":"1989"},{"issue":"11","key":"10.1016\/S0012-365X(97)00079-4_BIB10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0895-7177(93)90253-U","article-title":"Hamiltonian property of d-consecutive digraphs","volume":"17","author":"Du","year":"1993","journal-title":"Math. Comput. Modeling"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(91)90084-W","article-title":"The hamiltonian property of generalized de Bruijn digraphs","volume":"52","author":"Du","year":"1991","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB12","series-title":"Interconnection Networks and Mapping and Scheduling Parallel Computations","first-page":"75","article-title":"Modifications of consecutive-d digraphs","author":"Du","year":"1994"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB13","unstructured":"D.-Z. Du, D.F. Hsu, D.J. Kleitman, On connectivity of consecutive-d digraphs, manuscript."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(92)90131-S","article-title":"Connectivity of consecutive-d digraphs","volume":"37\/38","author":"Du","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.3230180105","article-title":"Generalized de Bruijn digraphs","volume":"18","author":"Du","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB16","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d,k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01788139","article-title":"Vosperian and superconnected abelian Cayley digraphs","volume":"7","author":"Hamidoune","year":"1991","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB18","series-title":"Proc. 11th British Conf., Ars Combin.","article-title":"Connectivity of generalized de Bruijn and Kautz graphs","author":"Homobono","year":"1988"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB19","series-title":"IEEE Trans. Comput.","article-title":"Connectivity of Imase and Itoh digraphs","author":"Homobono","year":"1988"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB20","series-title":"IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences E77-A:4","first-page":"668","article-title":"On container width and length in graphs, groups, and networks","author":"Hsu","year":"1994"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(87)90024-1","article-title":"The hamiltonian property of linear functions","volume":"6","author":"Hwang","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB22","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize a diameter on Building block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB23","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graph with minimum diameter","volume":"C-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameter","volume":"C-34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/S0012-365X(97)00079-4_BIB25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/scj.4690170803","article-title":"A fault tolerant processor interconnection network","volume":"17","author":"Imase","year":"1986","journal-title":"Systems and Computers in Japan"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB26","first-page":"20","article-title":"Bounds on directed (d, k) graphs, Theory of cellular logic networks and machines","author":"Kautz","year":"1968","journal-title":"AFCRL-68-0668 Final Report"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB27","series-title":"IEEE 1984 Int. Conf. Distributed Computing Systems","first-page":"448","article-title":"A class of graphs for fault-tolerant processor interconnections","author":"Kumar","year":"1984"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB28","first-page":"241","article-title":"General properties of c-circulant digraphs","volume":"25C","author":"Mora","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB29","first-page":"1018","article-title":"On digraphs with minimum diameter and maximum connectivity","author":"Reddy","year":"1982"},{"key":"10.1016\/S0012-365X(97)00079-4_BIB30","article-title":"Directed graphs with minimal diameter and maximal connectivity","author":"Reddy","year":"1980","journal-title":"School of Engineering Oakland Univ. Tech. Rep."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90069-O","article-title":"Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I","volume":"27","author":"Soneoka","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB32","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(94)00113-R","article-title":"Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II","volume":"64","author":"Soneoka","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)00079-4_BIB33","unstructured":"T. Soneoka, Super edge-connectivity of dense digraphs and graphs, manuscript."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:52:28Z","timestamp":1556131948000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0012365X97000794"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00079-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}