{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:18:13Z","timestamp":1740111493783,"version":"3.37.3"},"reference-count":21,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100009019","name":"Shenzhen University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100008940","name":"DIMACS","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008940","id-type":"DOI","asserted-by":"crossref"}]},{"name":"University of Puerto Rico at Mayaguez"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1016\/j.disc.2015.04.025","type":"journal-article","created":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T12:02:44Z","timestamp":1433505764000},"page":"1883-1906","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["The formulas for the number of spanning trees in circulant graphs"],"prefix":"10.1016","volume":"338","author":[{"given":"Min","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhibing","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaoqing","family":"Ruan","sequence":"additional","affiliation":[]},{"given":"Xuerong","family":"Yong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2015.04.025_br000005","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1515\/zna-2003-9-1003","article-title":"A simple method for computing resistance distance","volume":"58a","author":"Bapat","year":"2003","journal-title":"Z. Naturforsch"},{"year":"1993","series-title":"Algebraic Graph Theory","author":"Biggs","key":"10.1016\/j.disc.2015.04.025_br000010"},{"key":"10.1016\/j.disc.2015.04.025_br000015","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\/j.disc.2015.04.025_br000020","series-title":"Notes from New York Graph Theory Day V, page 16","article-title":"A conjecture on the number of spanning trees in the square of a cycle","author":"Boesch","year":"1982"},{"issue":"2","key":"10.1016\/j.disc.2015.04.025_br000025","first-page":"7","article-title":"An asymptotic enumeration theorem for the number of spanning trees in grids and tori","volume":"14","author":"Chen","year":"2001","journal-title":"J. Zhangzhou Teach. Coll. Nat. Sci."},{"key":"10.1016\/j.disc.2015.04.025_br000030","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1016\/j.disc.2006.09.034","article-title":"The number of spanning trees in directed circulant graphs with non-fixed jumps","volume":"307","author":"Chen","year":"2007","journal-title":"Discrete Math."},{"year":"1995","series-title":"Spectra of Graphs: Theory and Applications","author":"Cvetkovi\u010d","key":"10.1016\/j.disc.2015.04.025_br000035"},{"key":"10.1016\/j.disc.2015.04.025_br000040","first-page":"109","article-title":"The asymptotic number of spanning trees in d-dimensional square lattices","volume":"44","author":"Garcia","year":"2003","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.disc.2015.04.025_br000045","unstructured":"M.J. Golin, Y. Leung, Y. Wang, X. Yong, Counting structures in grid graphs, cylinders and tori using transfer matrices: survey and new results, in: The Proceedings of SIAM ALENEX\/ANALCO (Workshop on Analytic Algorithms and Combinatorics), British Columbia, Canada, 2005."},{"issue":"4","key":"10.1016\/j.disc.2015.04.025_br000050","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1016\/j.disc.2009.09.008","article-title":"The asymptotic number of spanning trees in circulant graphs","volume":"310","author":"Golin","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2015.04.025_br000055","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/andp.18471481202","article-title":"\u00dcber die Aufl\u00f6sung der gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Str\u00f6me gef\u00fchrt wird","volume":"72","author":"Kirchhoff","year":"1847","journal-title":"Annu. Rev. Phys. Chem."},{"issue":"1","key":"10.1016\/j.disc.2015.04.025_br000060","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<47::AID-NET6>3.0.CO;2-L","article-title":"On the asymptotic behavior of the maximum number of spanning trees in circulant graphs","volume":"30","author":"Lonc","year":"1997","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.disc.2015.04.025_br000065","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.2","article-title":"On the number of spanning trees in directed circulant graphs","volume":"37","author":"Lonc","year":"2001","journal-title":"Networks"},{"key":"10.1016\/j.disc.2015.04.025_br000070","unstructured":"J. Louis, A formula for the number of spanning trees in circulant graphs with non-fixed generators, Manuscript."},{"issue":"4","key":"10.1016\/j.disc.2015.04.025_br000075","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1017\/S096354830500684X","article-title":"Asymptotic enumeration of spanning trees","volume":"14","author":"Lyons","year":"2005","journal-title":"Combin. Probab. Comput."},{"year":"1961","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","key":"10.1016\/j.disc.2015.04.025_br000080"},{"key":"10.1016\/j.disc.2015.04.025_br000085","unstructured":"Daniel A. Spielman, Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices, in: Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010. Or see: http:\/\/www.cs.yale.edu\/homes\/spielman\/PAPERS\/icm10post.pdf."},{"key":"10.1016\/j.disc.2015.04.025_br000090","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0012-365X(96)00092-1","article-title":"The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4","volume":"169","author":"Yong","year":"1997","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2015.04.025_br000095","first-page":"264","article-title":"Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs & graphs","volume":"43","author":"Zhang","year":"1999","journal-title":"Science in China (Series A)"},{"key":"10.1016\/j.disc.2015.04.025_br000100","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(99)00414-8","article-title":"The number of spanning trees in circulant graphs","volume":"223","author":"Zhang","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2015.04.025_br000105","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.disc.2004.10.025","article-title":"Chebyshev polynomials and spanning tree formulas for circulant and related graphs","volume":"298","author":"Zhang","year":"2005","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15001582?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15001582?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T09:52:42Z","timestamp":1652262762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X15001582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S0012365X15001582"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2015.04.025","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The formulas for the number of spanning trees in circulant graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2015.04.025","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}