{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:10:13Z","timestamp":1768749013904,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0012-365x(96)00092-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"293-298","source":"Crossref","is-referenced-by-count":25,"title":["The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4"],"prefix":"10.1016","volume":"169","author":[{"given":"Xue-rong","family":"Yong","sequence":"first","affiliation":[]},{"given":"Talip","family":"Acenjian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00092-1_BIB1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/00150517.1985.12429821","article-title":"The number of spanning trees in the square of a cycle","author":"Baron","year":"1985","journal-title":"Fibonacci Quart."},{"key":"10.1016\/S0012-365X(96)00092-1_BIB2","first-page":"16","article-title":"A conjecture on the number of spanning trees in the square of a cycle","author":"Boesch","year":"1982"},{"key":"10.1016\/S0012-365X(96)00092-1_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01788093","article-title":"Spanning tree formulas and Chebyshev polynomials","volume":"2","author":"Boesch","year":"1986","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(96)00092-1_BIB4","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1976"},{"key":"10.1016\/S0012-365X(96)00092-1_BIB5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.2307\/2319131","article-title":"Counting trees in a certain class of graphs","volume":"82","author":"Kleitman","year":"1975","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0012-365X(96)00092-1_BIB6","first-page":"12","article-title":"A simple proof for the complexity of square cycle Cp2","volume":"11","author":"Yong","year":"1994","journal-title":"J. Xinjiang Univ."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:53:30Z","timestamp":1733342010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0012365X96000921"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00092-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}