{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:03Z","timestamp":1758823623425},"reference-count":8,"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)90130-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"157-167","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Examples of products giving large graphs with given degree and diameter"],"prefix":"10.1016","volume":"37-38","author":[{"given":"C.","family":"Delorme","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90130-3_BIB1","series-title":"Proceedings Colloquim Cambridge 1981","first-page":"23","article-title":"Large graphs with given degree and diameter III","volume":"13","author":"Bermond","year":"1982"},{"key":"10.1016\/0166-218X(92)90130-3_BIB2","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."},{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/0166-218X(92)90130-3_BIB3"},{"journal-title":"Dense symmetric networks from linear groups and codes","year":"1988","author":"Campbell","key":"10.1016\/0166-218X(92)90130-3_BIB4"},{"key":"10.1016\/0166-218X(92)90130-3_BIB5","first-page":"1","article-title":"Diameter of communication networks","volume":"34","author":"Chung","year":"1986"},{"key":"10.1016\/0166-218X(92)90130-3_BIB6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0195-6698(85)80043-3","article-title":"Grands graphes de degr\u00e9 et diam\u00e9tre donn\u00e9s","volume":"6","author":"Delorme","year":"1985","journal-title":"European J. Combin."},{"year":"1967","series-title":"Combinatorial Theory","author":"Hall","key":"10.1016\/0166-218X(92)90130-3_BIB7"},{"journal-title":"Graphs with given diameter and a coloring problem","year":"1976","author":"Wegner","key":"10.1016\/0166-218X(92)90130-3_BIB8"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901303?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:23:42Z","timestamp":1555122222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"alternative-id":["0166218X92901303"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90130-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}