{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:35:44Z","timestamp":1757543744253,"version":"3.41.2"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1984,9]]},"DOI":"10.1109\/tc.1984.1676504","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"857-860","source":"Crossref","is-referenced-by-count":21,"title":["Large Graphs with Given Degree and Diameter—Part I"],"prefix":"10.1109","volume":"C-33","author":[{"family":"Delorme","sequence":"first","affiliation":[{"name":"Department of Mathematics, University Paris-Sud"}]},{"family":"Farhi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Diam\ufffdtres dans les graphes et num\ufffdrotations gracieuses","year":"1981","author":"farhi","key":"ref10"},{"journal-title":"Stochastica","year":"1983","author":"fiol","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676455"},{"key":"ref13","article-title":"sequence graphs and interconnection networks","author":"fiol","year":"1983","journal-title":"Proc 9th British Combinatorial Conf"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80095-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90107-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675977"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676084"},{"journal-title":"New constructions of large graphs with fixed degree and diameter","year":"0","author":"quisquater","key":"ref19"},{"key":"ref4","article-title":"large graphs with given degree and diameter iii","author":"bermond","year":"1982","journal-title":"Proc Coll Cambridge 1981 Ann Disc Math 13"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90012-1"},{"key":"ref6","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 Processing Lett"},{"key":"ref5","article-title":"grands graphes non diriges de degreet diametre fixes","author":"bermond","year":"1982","journal-title":"Proc Coll Marseille 1981 Ann Disc Math 17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090304"},{"journal-title":"Strategies for interconnection networks Some methods from graph theory","year":"0","author":"bermond","key":"ref7"},{"key":"ref2","article-title":"diameters in graphs: a survey","author":"bermond","year":"1981","journal-title":"Proc 12th Southeastern Conf on Combinatorics Graph Theory Computing"},{"journal-title":"Extremal Graph Theory (London Mathematical Society Monographs 11)","year":"0","author":"bollobas","key":"ref1"},{"key":"ref9","first-page":"312","article-title":"large regular interconnection networks","author":"doty","year":"1982","journal-title":"Proc Int Conf on Distributed Computing Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325548.002"},{"key":"ref21","first-page":"758","article-title":"a combinatorial problem","author":"de bruijn","year":"1949","journal-title":"Proc Koninklijke Nederlandse Acad van Wetenschappen"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35240\/01676504.pdf?arnumber=1676504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:05:00Z","timestamp":1753121100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,9]]},"references-count":21,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.1984.1676504","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1984,9]]}}}