{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:30Z","timestamp":1759063710173},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90155-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"511-523","source":"Crossref","is-referenced-by-count":30,"special_numbering":"C","title":["Super edge-connectivity of dense digraphs and graphs"],"prefix":"10.1016","volume":"37-38","author":[{"given":"Terunao","family":"Soneoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90155-4_BIB1","series-title":"The Theory and Application of Graphs","first-page":"45","article-title":"Connectivity extremal problems in the analysis and design of probabilistic networks","author":"Bauer","year":"1981"},{"key":"10.1016\/0166-218X(92)90155-4_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(92)90155-4_BIB3","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90155-4_BIB4","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(92)90155-4_BIB5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","article-title":"Synthesis of reliable networks \u2014 A survey","volume":"35","author":"Boesch","year":"1986","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0166-218X(92)90155-4_BIB6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1137\/0120023","article-title":"On the invulnerability of the regular complete k-partite graphs","volume":"20","author":"Boesch","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(92)90155-4_BIB7","doi-asserted-by":"crossref","unstructured":"F.T. Boesch and J. Wang, Super line-connectivity properties of circulant graphs, SIAM J. Algebraic Discrete Methods, to appear.","DOI":"10.1137\/0607011"},{"key":"10.1016\/0166-218X(92)90155-4_BIB8","article-title":"External graph theory","volume":"11","author":"Bollobas","year":"1978"},{"key":"10.1016\/0166-218X(92)90155-4_BIB9","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":"29","author":"Bridge","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(92)90155-4_BIB10","author":"Campbell","year":"1983","journal-title":"Dense symmetric networks from linear groups and codes"},{"key":"10.1016\/0166-218X(92)90155-4_BIB11","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"10.1016\/0166-218X(92)90155-4_BIB12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/jgt.3190090411","article-title":"Lower-bounds on the connectivities of a graph","volume":"9","author":"Esfahanian","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(92)90155-4_BIB13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190130603","article-title":"Maximally connected digraphs","volume":"13","author":"Fabrega","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(92)90155-4_BIB14","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(92)90155-4_BIB15","series-title":"Proceedings 3rd Annual Conference Information Sciences and Systems","first-page":"1","article-title":"Maximally reliable node weighted graphs","author":"Frank","year":"1969"},{"key":"10.1016\/0166-218X(92)90155-4_BIB16","first-page":"444","article-title":"Connectivity of probabilistic networks","volume":"3","author":"Gel'mans","year":"1967","journal-title":"Automat. Remote Control"},{"key":"10.1016\/0166-218X(92)90155-4_BIB17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.3230030304","article-title":"On the design of reliable networks","volume":"3","author":"Hakimi","year":"1973","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90155-4_BIB18","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(92)90155-4_BIB19","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(92)90155-4_BIB20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameters","volume":"34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90155-4_BIB21","first-page":"20","article-title":"Bounds on directed (d,k) graphs","author":"Kautz","year":"1968","journal-title":"SRI Project 7258, Final Rept."},{"key":"10.1016\/0166-218X(92)90155-4_BIB22","series-title":"Tech. Rept.","article-title":"Directed graphs with minimal diameter and maximal connectivity","author":"Reddy","year":"1980"},{"key":"10.1016\/0166-218X(92)90155-4_BIB23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/net.3230140105","article-title":"Graphs with the smallest number of minimum cut-sets","volume":"14","author":"Smith","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90155-4_BIB24","doi-asserted-by":"crossref","unstructured":"T. Soneoka, M. Imase and Y. Manabe, Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter II, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)00113-R"},{"key":"10.1016\/0166-218X(92)90155-4_BIB25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90069-O","article-title":"Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter","volume":"27","author":"Soneoka","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90155-4_BIB26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(87)90151-8","article-title":"Sufficient conditions for maximally connected dense graphs","volume":"63","author":"Soneoka","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90155-4_BIB27","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:0166218X92901554?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901554?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:18Z","timestamp":1555136598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":27,"alternative-id":["0166218X92901554"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90155-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}