{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:24:54Z","timestamp":1757543094688,"version":"3.41.2"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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,2]]},"DOI":"10.1109\/tc.1984.1676410","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"190-194","source":"Crossref","is-referenced-by-count":12,"title":["Families of Fixed Degree Graphs for Processor Interconnection"],"prefix":"10.1109","volume":"C-33","author":[{"family":"Jerrum","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Edinburgh"}]},{"family":"Skyum","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Dense interconnection graphs with small degree","year":"1981","author":"leland","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90107-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675977"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/T-C.1970.222861","article-title":"improved construction techniques for (d, k) graphs","volume":"c 19","author":"storwick","year":"1970","journal-title":"IEEE Transactions on Computers"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325548.002"},{"journal-title":"Tables of large graphs with given degree and diameter","year":"1982","author":"bermond","key":"ref4"},{"journal-title":"Grands graphs non dirig\ufffds de degr\ufffdet diam\ufffdtre fix\ufffds","year":"1981","author":"bermond","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579310"},{"journal-title":"Extremal Graph Theory","year":"1978","author":"bollob\ufffds","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SWCT.1964.27"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100048015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-109-8"},{"key":"ref1","first-page":"191","article-title":"on finite moore graphs","volume":"20","author":"bannai","year":"1973","journal-title":"J Fac Sci Tokyo Math"},{"journal-title":"Graph Algorithms","year":"1979","author":"even","key":"ref9"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35235\/01676410.pdf?arnumber=1676410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:04:47Z","timestamp":1753121087000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tc.1984.1676410","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,2]]}}}