{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T13:07:35Z","timestamp":1660309655588},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0012-365x(91)90024-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"189-197","source":"Crossref","is-referenced-by-count":10,"title":["On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs"],"prefix":"10.1016","volume":"94","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(91)90024-V_BIB1","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9947-1963-0155841-7","article-title":"Roots and canonical forms for circulant matrices","volume":"107","author":"Ablow","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(91)90024-V_BIB2","series-title":"Graphs","first-page":"49","author":"Berge","year":"1985"},{"key":"10.1016\/0012-365X(91)90024-V_BIB3","series-title":"Algebraic Graph Theory","first-page":"34","author":"Biggs","year":"1974"},{"key":"10.1016\/0012-365X(91)90024-V_BIB4","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Proc. K. Ned. Akad. Wet. Ser. A"},{"key":"10.1016\/0012-365X(91)90024-V_BIB5","series-title":"Applied Graph Theory","author":"Chen","year":"1971"},{"issue":"1","key":"10.1016\/0012-365X(91)90024-V_BIB6","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"},{"issue":"2","key":"10.1016\/0012-365X(91)90024-V_BIB7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","article-title":"A survey of full length nonlinear shift register cycle algorithms","volume":"24","author":"Fredricksen","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1016\/0012-365X(91)90024-V_BIB8","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."},{"key":"10.1016\/0012-365X(91)90024-V_BIB9","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\/0012-365X(91)90024-V_BIB10","first-page":"1348","article-title":"The characteristic polynomials of line diagraphs and a class of cospectral diagraphs","volume":"22","author":"Lin","year":"1983","journal-title":"Kexue Tongbao"},{"key":"10.1016\/0012-365X(91)90024-V_BIB11","series-title":"Tech. Report","article-title":"Directed graphs with minimum diameter and maximal connectivity","author":"Reddy","year":"1980"},{"key":"10.1016\/0012-365X(91)90024-V_BIB12","article-title":"The complexity of digraphs","author":"Zhang","year":"1986","journal-title":"Proc. 1st China\u2014USA Internat. Conf. on Graph Theory and its Applications"},{"issue":"2","key":"10.1016\/0012-365X(91)90024-V_BIB13","first-page":"195","article-title":"On de Bruijn-good graphs","volume":"30","author":"Zhang","year":"1987","journal-title":"Acta Math. Sinica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190024V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190024V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:51Z","timestamp":1555136571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190024V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0012365X9190024V"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90024-v","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}