{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:28:17Z","timestamp":1673144897350},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0166-218x(94)00113-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"267-279","source":"Crossref","is-referenced-by-count":4,"title":["Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter: II"],"prefix":"10.1016","volume":"64","author":[{"given":"Terunao","family":"Soneoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Imase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshifumi","family":"Manabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00113-R_BIB1","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/TCOM.1970.1090418","article-title":"Optimally invulnerable directed communication networks","volume":"18","author":"Ayoub","year":"1970","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-218X(94)00113-R_BIB2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(94)00113-R_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0095-8956(80)90091-X","article-title":"On the impossibility of directed Moore graphs","volume":"B 29","author":"Bridge","year":"1980","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/0166-218X(94)00113-R_BIB4","unstructured":"D.Z. Du, D.F. Hsu and G.W. Peck, Connectivity of consecutive-d digraphs. Discrete Appl. Math., submitted."},{"key":"10.1016\/0166-218X(94)00113-R_BIB5","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\/0166-218X(94)00113-R_BIB6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d, k) digraph problem","volume":"33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00113-R_BIB7","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":"30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00113-R_BIB8","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","volume":"32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00113-R_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameter","volume":"34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00113-R_BIB10","first-page":"241","article-title":"General properties of c-circulant digraphs","volume":"25C","author":"Mora","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(94)00113-R_BIB11","article-title":"Directed graphs with minimal diameter and maximal connectivity jt]Technical Report, School of Engineering","author":"Reddy","year":"1980"},{"key":"10.1016\/0166-218X(94)00113-R_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/net.3230140106","article-title":"An algorithm for construction of k-connected graph with minimum number of edges and quasiminimal diameter","volume":"14","author":"Schumacher","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)00113-R_BIB13","series-title":"Proceedings of the 17th International Symposium on Fault-Tolerant Computing","first-page":"198","article-title":"A synthesis approach to design optimally fault tolerant network architecture","author":"Sengupta","year":"1987"},{"key":"10.1016\/0166-218X(94)00113-R_BIB14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90069-O","article-title":"A design of d-connected digraph with minimum number of edges and quasiminimal diameter I","volume":"27","author":"Soneoka","year":"1990","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400113R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400113R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:25:44Z","timestamp":1556652344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400113R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0166218X9400113R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00113-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}