{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T13:20:02Z","timestamp":1783948802278,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T00:00:00Z","timestamp":1407369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s11432-014-5110-z","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T10:09:32Z","timestamp":1407406172000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The number of spanning trees in a new lexicographic product of graphs"],"prefix":"10.1007","volume":"57","author":[{"given":"Dong","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ZongBen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"5110_CR1","first-page":"276","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley A. A theorem on trees. Quart J Math, 1889, 23: 276\u2013278","journal-title":"Quart J Math"},{"key":"5110_CR2","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/TIP.2012.2220150","volume":"22","author":"J Ho","year":"2013","unstructured":"Ho J, Hwang W. Wavelet Bayesian network image denoising. IEEE Trans Image Process, 2013, 22: 1277\u20131290","journal-title":"IEEE Trans Image Process"},{"key":"5110_CR3","first-page":"3220","volume-title":"ICPR","author":"W H Ou","year":"2012","unstructured":"Ou W H, You X G, Cheung Y M, et al. Structured sparse coding for image representation based on L1-graph. ICPR, 2012: 3220\u20133223"},{"key":"5110_CR4","first-page":"1","volume":"1","author":"J Gonzalez","year":"2009","unstructured":"Gonzalez J, Low Y, Guestrin C. Parallel splash belief propagation. J Mach Learn Res, 2009, 1: 1\u201348","journal-title":"J Mach Learn Res"},{"key":"5110_CR5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/S0095-8956(81)80028-7","volume":"31","author":"C Cheng","year":"1981","unstructured":"Cheng C. Maximizing the total number spanning trees in a graph: two related problems in graph theory and optimization design theory. J Combin Theory B, 1981, 31: 240\u2013248","journal-title":"J Combin Theory B"},{"key":"5110_CR6","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.aml.2010.12.049","volume":"24","author":"B L Li","year":"2011","unstructured":"Li B L, Zhang S G. Heavy cycles and spanning trees with few leaves in weighted graphs. Appl Math Lett, 2011, 24: 908\u2013910","journal-title":"Appl Math Lett"},{"key":"5110_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0252-9602(18)30032-8","volume":"15","author":"Z Huang","year":"1995","unstructured":"Huang Z, Li X. On the number of spanning trees of some composite graphs (in Chinese). Acta Math Sci, 1995, 15: 259\u2013268","journal-title":"Acta Math Sci"},{"key":"5110_CR8","volume-title":"On the Number of Spanning Trees of Graphs and Applications of Networks","author":"X Li","year":"1999","unstructured":"Li X, Huang Z. On the Number of Spanning Trees of Graphs and Applications of Networks. Harbin: Harbin Institute of Technology Press, 1999"},{"key":"5110_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(99)00414-8","volume":"223","author":"Y Zhang","year":"2000","unstructured":"Zhang Y, Yong X, Golin M J. The number of spanning trees in circulant graphs. Discrete Appl Math, 2000, 223: 337\u2013350","journal-title":"Discrete Appl Math"},{"key":"5110_CR10","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs N. Algebraic Graph Theory. 2nd ed. Cambridge: Cambridge University Press, 1993","edition":"2nd ed"},{"key":"5110_CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01788093","volume":"2","author":"F Boesch","year":"1986","unstructured":"Boesch F, Prodinger H. Spanning tree formulas and Chebyshev polynomials. Graph Combinator, 1986, 2: 191\u2013200","journal-title":"Graph Combinator"},{"key":"5110_CR12","first-page":"1","volume-title":"Notes from New York Graph Theory Day V","author":"F Boesch","year":"1982","unstructured":"Boesch F, Wang J F. A conjecture on the number of spanning trees in the square of a cycle. In: Notes from New York Graph Theory Day V. New York: New York Academy Sciences, 1982. 1\u201316"},{"key":"5110_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(00)00135-6","volume":"76","author":"K L Chung","year":"2000","unstructured":"Chung K L, Yan W M. On the number of spanning trees of a multi-complete\/star related graphs. Inform Process Lett, 2000, 76: 113\u2013119","journal-title":"Inform Process Lett"},{"key":"5110_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(94)00049-J","volume":"65","author":"B Gilbert","year":"1996","unstructured":"Gilbert B, Kelman A K. Laplacian spectra and spanning trees of threshold graphs. Discrete Math, 1996, 65: 255\u2013273","journal-title":"Discrete Math"},{"key":"5110_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01472575","volume":"80","author":"W Imrich","year":"1975","unstructured":"Imrich W, Izbicki H. Associative products of graphs. Monatsh Math, 1975, 80: 277\u2013281","journal-title":"Monatsh Math"},{"key":"5110_CR16","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.aml.2010.03.013","volume":"23","author":"Z Zhang","year":"2010","unstructured":"Zhang Z, Zhu Y F. Cyclic arc-connectivity in a Cartesian product digraph. Appl Math Lett, 2010, 23: 796\u2013800","journal-title":"Appl Math Lett"},{"key":"5110_CR17","first-page":"51","volume":"7","author":"F Li","year":"2011","unstructured":"Li F, Peng Y, Zhao H X. On the number of spanning trees of the multi-lexicographic product of networks (in Chinese). Software, 2011, 7: 51\u201353","journal-title":"Software"},{"key":"5110_CR18","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1360\/112010-1050","volume":"42","author":"F Li","year":"2012","unstructured":"Li F, Xu Z B, Zhao H X, et al. On the number of spanning trees of the lexicographic product of networks. Scientia Sin Inform, 2012, 42: 949\u2013959","journal-title":"Scientia Sin Inform"},{"key":"5110_CR19","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.aml.2011.05.021","volume":"24","author":"F Li","year":"2011","unstructured":"Li F, Wang W, Xu Z B, et al. Some results on the lexicographic product of vertex-transitive graphs. Appl Math Lett, 2011, 24: 1924\u20131926","journal-title":"Appl Math Lett"},{"key":"5110_CR20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.endm.2009.03.018","volume":"33","author":"V Yegnanarayanan","year":"2009","unstructured":"Yegnanarayanan V, Thiripurasundari P R. On some graph operations and related applications. Electron Notes Discrete Math, 2009, 33: 123\u2013130","journal-title":"Electron Notes Discrete Math"},{"key":"5110_CR21","first-page":"261","volume-title":"Enumerating Labelled Trees, Graph Theory and Theoretical Physics","author":"J Moon","year":"1967","unstructured":"Moon J. Enumerating Labelled Trees, Graph Theory and Theoretical Physics. New York: New York Academic Press, 1967. 261\u2013272"},{"key":"5110_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(74)90065-3","volume":"16","author":"A K Kelman","year":"1974","unstructured":"Kelman A K, Chelnokov V M. A certain polynomials of a graph and graphs with an extremal number of trees. J Combin Theory B, 1974, 16: 197\u2013214","journal-title":"J Combin Theory B"},{"key":"5110_CR23","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1016\/j.laa.2010.11.024","volume":"434","author":"W Wang","year":"2011","unstructured":"Wang W, Li F, Lu H L, et al. Graphs determined by their generalized characteristic polynomials. Linear Algebra Appl, 2011, 434: 1378\u20131387","journal-title":"Linear Algebra Appl"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5110-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5110-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5110-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T13:18:29Z","timestamp":1565702309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5110-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,7]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["5110"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5110-z","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,7]]}}}