{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:46Z","timestamp":1761611146018},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":10759,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1016\/0095-8956(84)90012-1","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"32-48","source":"Crossref","is-referenced-by-count":44,"title":["Large graphs with given degree and diameter. II"],"prefix":"10.1016","volume":"36","author":[{"given":"J.C","family":"Bermond","sequence":"first","affiliation":[]},{"given":"C","family":"Delorme","sequence":"additional","affiliation":[]},{"given":"G","family":"Farhi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90012-1_BIB1","series-title":"Proceedings, 12th Southeastern Conference on Combinatorics Graph Theory and Computing","first-page":"3","article-title":"Diameters in graphs: A survey","volume":"32","author":"Bermond","year":"1981"},{"key":"10.1016\/0095-8956(84)90012-1_BIB2","series-title":"Proc. Coll. Cambridge 1981","first-page":"23","article-title":"Large graphs with given degree and diameter III","volume":"13","author":"Bermond","year":"1982"},{"key":"10.1016\/0095-8956(84)90012-1_BIB3","author":"Biggs","year":"1974"},{"key":"10.1016\/0095-8956(84)90012-1_BIB4","article-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0095-8956(84)90012-1_BIB5","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. H. Poincar\u00e9, Sect. B"},{"key":"10.1016\/0095-8956(84)90012-1_BIB6","doi-asserted-by":"crossref","unstructured":"C. Delorme, Grands graphes de degr\u00e9 et diam\u00e8tre donn\u00e9s, Europ. J. Combinat., in press.","DOI":"10.1016\/S0195-6698(85)80043-3"},{"key":"10.1016\/0095-8956(84)90012-1_BIB7","doi-asserted-by":"crossref","unstructured":"C. Delorme and G. Farhi, Large graphs with given diameter I, IEEE Trans. Comput., in press.","DOI":"10.1109\/TC.1984.1676504"},{"key":"10.1016\/0095-8956(84)90012-1_BIB8","first-page":"133","article-title":"Topological constraints on interconnection limited logic","volume":"Vol. 5\u2013164","author":"Elspas","year":"1964"},{"key":"10.1016\/0095-8956(84)90012-1_BIB9","author":"Harary","year":"1972"},{"key":"10.1016\/0095-8956(84)90012-1_BIB10","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.1982.1676084","article-title":"Some new results about the (d, k) graph problem","volume":"31","author":"Memmi","year":"1982","journal-title":"I.E.E.E., Trans. Comput."},{"key":"10.1016\/0095-8956(84)90012-1_BIB11","unstructured":"J. J. Quisquater, manuscripts to be published."},{"key":"10.1016\/0095-8956(84)90012-1_BIB12","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/T-C.1970.222861","article-title":"Improved constructions techniques for (d, k) graphs","volume":"19","author":"Storwick","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0095-8956(84)90012-1_BIB13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(82)90076-X","article-title":"Tables of large graphs with given degree and diameter","volume":"15","author":"Bermond","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0095-8956(84)90012-1_BIB14","series-title":"Graphs and Interconnection Networks: Diameter and Vulnerability, in Surveys in Combinatorics","first-page":"1","volume":"Vol. 82","author":"Bermond","year":"1983"},{"key":"10.1016\/0095-8956(84)90012-1_BIB15","doi-asserted-by":"crossref","unstructured":"C. Delorme, Large bipartite graphs with given degree and diameter, J. Graph Theory, in press.","DOI":"10.1002\/jgt.3190090304"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900121?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900121?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:53:24Z","timestamp":1548881604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0095895684900121"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90012-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}