{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:50:28Z","timestamp":1762210228724},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0020-0190(94)90090-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"135-138","source":"Crossref","is-referenced-by-count":8,"title":["Counting closed walks in generalized de Bruijn graphs"],"prefix":"10.1016","volume":"49","author":[{"given":"Yukio","family":"Shibata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miyuki","family":"Shirahata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"Osawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90090-6_BIB1","series-title":"Hypercube and Distributed Computers","article-title":"De Bruijn and Kautz networks: A competitor for the hypercube?","author":"Bermond","year":"1989"},{"key":"10.1016\/0020-0190(94)90090-6_BIB2","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Proc. Kon. Nederl. Akad. Wetensch. Ser. A"},{"key":"10.1016\/0020-0190(94)90090-6_BIB3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.3230180105","article-title":"Generalized de Bruijn digraphs","volume":"18","author":"Du","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0020-0190(94)90090-6_BIB4","series-title":"Concrete Mathematics","author":"Graham","year":"1988"},{"issue":"6","key":"10.1016\/0020-0190(94)90090-6_BIB5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/0020-0190(94)90090-6_BIB6","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\/0020-0190(94)90090-6_BIB7","series-title":"Tech. Rept.","article-title":"Directed graphs with minimal diameter and maximum node connectivity","author":"Reddy","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:22Z","timestamp":1555144162000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900906"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90090-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}