{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:05Z","timestamp":1761611105153},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987,1]]},"DOI":"10.1016\/0012-365x(87)90151-8","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T01:10:51Z","timestamp":1045012251000},"page":"53-66","source":"Crossref","is-referenced-by-count":60,"title":["Sufficient conditions for maximally connected dense graphs"],"prefix":"10.1016","volume":"63","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"}]},{"given":"Claudine","family":"Peyrat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90151-8_BIB1","first-page":"10","article-title":"Tables of large graphs with given degree and diameter","volume":"15","author":"Bermond","year":"1982"},{"key":"10.1016\/0012-365X(87)90151-8_BIB2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(84)90012-1","article-title":"Large graphs with given degree and diameter II","volume":"36","author":"Bermond","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(87)90151-8_BIB3","article-title":"Strategies for interconnection networks: Some methods from graph theory","author":"Bermond","year":"1985","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0012-365X(87)90151-8_BIB4","article-title":"Extermal graph theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/0012-365X(87)90151-8_BIB5","first-page":"758","article-title":"A combinatorial problem","volume":"Vol. 49","author":"De Bruijn","year":"1946"},{"key":"10.1016\/0012-365X(87)90151-8_BIB6","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\/0012-365X(87)90151-8_BIB7","series-title":"Proc. 10th Internat. Symposium Comp. Architecture","first-page":"174","article-title":"Line diagraph iterations and the (d, k) problem for directed graphs","author":"Fiol","year":"1983"},{"key":"10.1016\/0012-365X(87)90151-8_BIB8","article-title":"Connexite des graphes de Kautz et de de Bruijn","author":"Homobono","year":"1985","journal-title":"Rapport de DEA L.R.I. Orsay"},{"key":"10.1016\/0012-365X(87)90151-8_BIB9","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. Computer"},{"key":"10.1016\/0012-365X(87)90151-8_BIB10","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\/0012-365X(87)90151-8_BIB11","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\/0012-365X(87)90151-8_BIB12","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, SRI Project 7258, Final Report"},{"key":"10.1016\/0012-365X(87)90151-8_BIB13","series-title":"Combinatorial Problems and Exercises","author":"Lovasz","year":"1979"},{"key":"10.1016\/0012-365X(87)90151-8_BIB14","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\/0012-365X(87)90151-8_BIB15","first-page":"811","article-title":"Sufficient conditions for dense graphs to be maximally connected","volume":"85","author":"Soneoka","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901518?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901518?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:23:14Z","timestamp":1553790194000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87901518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0012365X87901518"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90151-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}