{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:07:11Z","timestamp":1743019631052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319509006"},{"type":"electronic","value":"9783319509013"}],"license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50901-3_16","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:02:04Z","timestamp":1480464124000},"page":"197-208","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Analysis of \u201cSmall-World Networks\u201d and Spanning Tree Entropy"],"prefix":"10.1007","author":[{"given":"Raihana","family":"Mokhlissi","sequence":"first","affiliation":[]},{"given":"Dounia","family":"Lotfi","sequence":"additional","affiliation":[]},{"given":"Joyati","family":"Debnath","sequence":"additional","affiliation":[]},{"given":"Mohamed El","family":"Marraki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Amaral, L.A.N., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small-world networks. Proceedings of the national academy of sciences 97(21), 11,149\u201311,152 (2000)","key":"16_CR1","DOI":"10.1073\/pnas.200327197"},{"doi-asserted-by":"crossref","unstructured":"Anishchenko, A., Blumen, A., M\u00a8ulken, O.: Enhancing the spreading of quantum walks on star graphs by additional bonds. Quantum Information Processing 11(5), 1273\u20131286 (2012)","key":"16_CR2","DOI":"10.1007\/s11128-012-0376-9"},{"doi-asserted-by":"crossref","unstructured":"Chaiken, S., Kleitman, D.J.: Matrix tree theorems. Journal of combinatorial theory, Series A 24(3), 377\u2013381 (1978)","key":"16_CR3","DOI":"10.1016\/0097-3165(78)90067-5"},{"doi-asserted-by":"crossref","unstructured":"Chang, S.C., Chen, L.C., Yang, W.S.: Spanning trees on the sierpinski gasket. Journal of Statistical Physics 126(3), 649\u2013667 (2007)","key":"16_CR4","DOI":"10.1007\/s10955-006-9262-0"},{"unstructured":"Colbourn, C.J., Colbourn, C.: The combinatorics of network reliability, vol. 200. Oxford University Press New York (1987)","key":"16_CR5"},{"doi-asserted-by":"crossref","unstructured":"Cooper, C., Frieze, A.: A general model of web graphs. Random Structures & Algorithms 22(3), 311\u2013335 (2003)","key":"16_CR6","DOI":"10.1002\/rsa.10084"},{"doi-asserted-by":"crossref","unstructured":"Hillery, M., Reitzner, D., Bu\u02c7zek, V.: Searching via walking: How to find a marked clique of a complete graph using quantum walks. Physical Review A 81(6), 062,324 (2010)","key":"16_CR7","DOI":"10.1103\/PhysRevA.81.062324"},{"doi-asserted-by":"crossref","unstructured":"Jespersen, S., Sokolov, I., Blumen, A.: Relaxation properties of small-world networks. Physical Review E 62(3), 4405 (2000)","key":"16_CR8","DOI":"10.1103\/PhysRevE.62.4405"},{"doi-asserted-by":"crossref","unstructured":"Lyons, R.: Asymptotic enumeration of spanning trees. Combinatorics, Probability and Computing 14(04), 491\u2013522 (2005)","key":"16_CR9","DOI":"10.1017\/S096354830500684X"},{"doi-asserted-by":"crossref","unstructured":"Marti, K.H., Bauer, B., Reiher, M., Troyer, M., Verstraete, F.: Complete-graph tensor network states: a new fermionic wave function ansatz for molecules. New Journal of Physics 12(10), 103,008 (2010)","key":"16_CR10","DOI":"10.1088\/1367-2630\/12\/10\/103008"},{"doi-asserted-by":"crossref","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392\u2013395 (2005)","key":"16_CR11","DOI":"10.1038\/nature03248"},{"doi-asserted-by":"crossref","unstructured":"Standish, R.K.: Complexity of networks (reprise). Complexity 17(3), 50\u201361 (2012)","key":"16_CR12","DOI":"10.1002\/cplx.20393"},{"doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. nature 393(6684), 440\u2013442 (1998)","key":"16_CR13","DOI":"10.1038\/30918"},{"doi-asserted-by":"crossref","unstructured":"Wu, B.Y., Chao, K.M.: Spanning trees and optimization problems. CRC Press (2004)","key":"16_CR14","DOI":"10.1201\/9780203497289"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Z., Wu, S., Li, M., Comellas, F.: The number and degree distribution of spanning trees in the tower of hanoi graph. Theoretical Computer Science 609, 443\u2013455 (2016)","key":"16_CR15","DOI":"10.1016\/j.tcs.2015.10.032"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50901-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T22:55:46Z","timestamp":1568588146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50901-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"ISBN":["9783319509006","9783319509013"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50901-3_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,11,30]]}}}