{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:27:23Z","timestamp":1755034043384},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/0166-218x(95)00118-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"59-67","source":"Crossref","is-referenced-by-count":6,"title":["On the number of spanning trees and Eulerian tours in iterated line digraphs"],"prefix":"10.1016","volume":"73","author":[{"given":"Zhang","family":"Huaxiao","sequence":"first","affiliation":[]},{"given":"Zhang","family":"Fuji","sequence":"additional","affiliation":[]},{"given":"Huang","family":"Qiongxiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00118-B_BIB1","series-title":"Surveys in Combinatorics","article-title":"Graph and interconnection networks: diameter and vulnerability","volume":"Vol. 28","author":"Bermond","year":"1983"},{"key":"10.1016\/0166-218X(95)00118-B_BIB2_1","series-title":"Proceedings of the 1st Japan International Conference on Graph Theory and Applications","article-title":"Large fault tolerant interconnection networks","author":"Bermond","year":"1986"},{"key":"10.1016\/0166-218X(95)00118-B_BIB2_2","first-page":"107","volume":"5","author":"Bermond","year":"1989"},{"key":"10.1016\/0166-218X(95)00118-B_BIB3","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0166-218X(95)00118-B_BIB4","series-title":"Applied Graph Theory","author":"Chen","year":"1971"},{"key":"10.1016\/0166-218X(95)00118-B_BIB5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iteration and the (d, k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(95)00118-B_BIB6","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1987.1676963","article-title":"A discrete optimization problem in local networks and data alignment","volume":"C-36","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(95)00118-B_BIB7","first-page":"1348","article-title":"The characteristic polynomial of the directed line graph and a type of cospectral digraphs","volume":"22","author":"Fuji","year":"1983","journal-title":"Kexue Tongbao"},{"key":"10.1016\/0166-218X(95)00118-B_BIB8","first-page":"368","article-title":"Digraph categories and line digraph functors","volume":"13B","author":"Fuji","year":"1992","journal-title":"Chinese Ann. Math."},{"key":"10.1016\/0166-218X(95)00118-B_BIB9","series-title":"Proceedings of the Conference at Western Michigan University","first-page":"149","article-title":"Line digraphs","volume":"Vol. 303","author":"Hemminger","year":"1972"},{"key":"10.1016\/0166-218X(95)00118-B_BIB10","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"Design to minimize diameter on building-block networks","volume":"C-30","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(95)00118-B_BIB11","series-title":"Architecture and Design of Digital Computers","first-page":"219","article-title":"Design of optimal interconnection networks for multiprocessors","author":"Kautz","year":"1969"},{"key":"10.1016\/0166-218X(95)00118-B_BIB12","first-page":"189","article-title":"On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs","volume":"91","author":"Xueliang","year":"1991","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500118B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500118B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:26:14Z","timestamp":1556652374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500118B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["0166218X9500118B"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00118-b","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}