{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T00:27:59Z","timestamp":1676161679335},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0166-218x(90)90069-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"255-265","source":"Crossref","is-referenced-by-count":10,"title":["Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter"],"prefix":"10.1016","volume":"27","author":[{"given":"Terunao","family":"Soneoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nakada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Imase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90069-O_BIB1","article-title":"Large fault-tolerant interconnection networks","author":"Bermond","year":"1986","journal-title":"Proceedings 1st Japan International Conference on Graph Theory and Applications"},{"issue":"2","key":"10.1016\/0166-218X(90)90069-O_BIB2","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"Bruijn","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"10.1016\/0166-218X(90)90069-O_BIB3","doi-asserted-by":"crossref","unstructured":"D.Z. Du and F.K. Hwang, Generalized de Bruijn digraphs, Networks, to appear.","DOI":"10.1002\/net.3230180105"},{"key":"10.1016\/0166-218X(90)90069-O_BIB4","unstructured":"J. Fabrega, M.A. Fiol and M. Escudero, The connectivity of iterated line digraphs, J. Graph Theory, to appear."},{"issue":"6","key":"10.1016\/0166-218X(90)90069-O_BIB5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0166-218X(90)90069-O_BIB6","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(90)90069-O_BIB7","series-title":"Tech. Rept. School Engineering","article-title":"Directed graphs with minimal diameter and maximal connectivity","author":"Reddy","year":"1980"},{"key":"10.1016\/0166-218X(90)90069-O_BIB8","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(90)90069-O_BIB9","first-page":"198","article-title":"A synthesis approach to design optimally fault tolerant network architecture","author":"Sengupta","year":"1987","journal-title":"Proceeding 17th International Symposium on Fault-Tolerant Computing"},{"key":"10.1016\/0166-218X(90)90069-O_BIB10","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TCOM.1972.1091214","article-title":"Analysis and design of reliable computer networks","volume":"20","author":"Wilkov","year":"1972","journal-title":"IEEE Trans. Comm."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090069O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090069O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:09Z","timestamp":1555135029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090069O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0166218X9090069O"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90069-o","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}