{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:28:50Z","timestamp":1768746530780,"version":"3.49.0"},"reference-count":46,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100006319","name":"CNRST","doi-asserted-by":"publisher","award":["43UM5R2015"],"award-info":[{"award-number":["43UM5R2015"]}],"id":[{"id":"10.13039\/501100006319","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Enumerating all the spanning trees of a complex network is theoretical defiance for mathematicians, electrical engineers and computer scientists. In this article, we propose a generalization of the Fractal Scale-Free Lattice and we study its structural properties. As its degree distribution follows a power law, we prove that the proposed generalization does not affect the scale-free property. In addition, we use the electrically equivalent transformations to count the number of spanning trees in the generalized Fractal Scale-Free Lattice. Finally, in order to evaluate the robustness of the generalized lattice, we compute and compare its entropy with other complex networks having the same average degree.<\/jats:p>","DOI":"10.1093\/comnet\/cnz030","type":"journal-article","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T19:13:05Z","timestamp":1563304385000},"source":"Crossref","is-referenced-by-count":4,"title":["The structural properties and the spanning trees entropy of the generalized Fractal Scale-Free Lattice"],"prefix":"10.1093","volume":"8","author":[{"given":"Raihana","family":"Mokhlissi","sequence":"first","affiliation":[{"name":"LRIT\u2014CNRST URAC 29, Rabat IT Center, Faculty of Sciences, Mohammed V University in Rabat, B.P 1014 Rabat, Morocco"}]},{"given":"Dounia","family":"Lotfi","sequence":"additional","affiliation":[{"name":"LRIT\u2014CNRST URAC 29, Rabat IT Center, Faculty of Sciences, Mohammed V University in Rabat, B.P 1014 Rabat, Morocco"}]},{"given":"Mohamed","family":"El Marraki","sequence":"additional","affiliation":[{"name":"LRIT\u2014CNRST URAC 29, Rabat IT Center, Faculty of Sciences, Mohammed V University in Rabat, B.P 1014 Rabat, Morocco"}]},{"given":"Joyati","family":"Debnath","sequence":"additional","affiliation":[{"name":"Winona State University, Winona, MN 55987, USA"}]}],"member":"286","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"2020072910570475500_B1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabsi,","year":"1999","journal-title":"Science"},{"key":"2020072910570475500_B2","doi-asserted-by":"crossref","first-page":"5207","DOI":"10.1073\/pnas.032085699","article-title":"Winners don\u2019t take all: characterizing the competition for links on the web","volume":"99","author":"Pennock,","year":"2002","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"2020072910570475500_B3","volume-title":"Evolution and Structure of the Internet: A Statistical Physics Approach","author":"Pastor-Satorras,","year":"2007"},{"key":"2020072910570475500_B4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong,","year":"2001","journal-title":"Nature"},{"key":"2020072910570475500_B5","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of small-world networks","volume":"393","author":"Watts,","year":"1998","journal-title":"Nature"},{"key":"2020072910570475500_B6","volume-title":"Small Worlds: The Dynamics of Networks Between Order and Randomness","author":"Watts,","year":"2000"},{"key":"2020072910570475500_B7","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/1017308","article-title":"The evaluation of the number and the entropy of spanning trees on generalized small-world networks","volume":"2018","author":"Mokhlissi,","year":"2018","journal-title":"J. Appl. Math."},{"key":"2020072910570475500_B8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erdos,","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"2020072910570475500_B9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-0-387-79711-3","volume-title":"Combinatorics and Graph Theory","author":"Harris,","year":"2008"},{"key":"2020072910570475500_B10","volume-title":"Graph Theory Applications","author":"Foulds,","year":"2012"},{"key":"2020072910570475500_B11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"Bondy,","year":"1976"},{"key":"2020072910570475500_B12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008605912200","article-title":"Aztec diamonds, checkerboard graphs, and spanning trees","volume":"6","author":"Knuth,","year":"1997","journal-title":"J. Algebr. Comb."},{"key":"2020072910570475500_B13","doi-asserted-by":"crossref","DOI":"10.1201\/9780203497289","volume-title":"Spanning trees and optimization problems","author":"Wu,","year":"2004"},{"key":"2020072910570475500_B14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/cplx.20393","article-title":"Complexity of networks (reprise)","volume":"17","author":"Standish,","year":"2012","journal-title":"Complexity"},{"key":"2020072910570475500_B15","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/TR.2017.2738659","article-title":"Reliability analysis of ethernet ring mesh networks","volume":"66","author":"Bistouni,","year":"2017","journal-title":"IEEE Trans. Reliab."},{"key":"2020072910570475500_B16","doi-asserted-by":"crossref","first-page":"065106","DOI":"10.1103\/PhysRevE.73.065106","article-title":"Synchronization is optimal in nondiagonalizable networks","volume":"73","author":"Nishikawa,","year":"2006","journal-title":"Phys. Rev. E"},{"key":"2020072910570475500_B17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.physa.2006.04.004","article-title":"Theoretical studies of self-organized criticality","volume":"369","author":"Dhar,","year":"2006","journal-title":"Physica A"},{"key":"2020072910570475500_B18","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1146\/annurev.soc.34.040507.134601","article-title":"Social networks and health","volume":"34","author":"Smith,","year":"2008","journal-title":"Annu. Rev. Sociol"},{"key":"2020072910570475500_B19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1214\/ECP.v5-1016","article-title":"Loop-erased random walks, spanning trees and Hamiltonian cycles","volume":"5","author":"Marchal,","year":"2000","journal-title":"Electron Commun. Prob."},{"key":"2020072910570475500_B20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0097-3165(78)90067-5","article-title":"Matrix tree theorems","volume":"24","author":"Chaiken,","year":"1978","journal-title":"J. Comb. Theory A"},{"key":"2020072910570475500_B21","first-page":"1","article-title":"The Laplacian on planar graphs and graphs on surfaces","volume-title":"Current Developments in Mathematics","author":"Kenyon,","year":"2012"},{"key":"2020072910570475500_B22","doi-asserted-by":"crossref","first-page":"016116","DOI":"10.1103\/PhysRevE.83.016116","article-title":"Spanning trees in a fractal scale-free lattice","volume":"83","author":"Zhang,","year":"2011","journal-title":"Phys. Rev. E"},{"key":"2020072910570475500_B23","first-page":"673","article-title":"The enumeration of spanning trees in dual, bipartite and reduced graphs","volume":"18","author":"Lotfi,","year":"2015","journal-title":"J. Discrete Math. Sci. Crypt."},{"key":"2020072910570475500_B24","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","article-title":"A theorem on graphs","volume":"32","author":"Whitney,","year":"1931","journal-title":"Ann. Math."},{"key":"2020072910570475500_B25","first-page":"24","article-title":"A theoretical study of the complexity of complex networks","author":"Mokhlissi,","year":"2016","journal-title":"The 7th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT). IEEE"},{"key":"2020072910570475500_B26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-59647-1_1","article-title":"An innovative combinatorial approach for the spanning tree entropy in flower network","volume-title":"International Conference on Networked Systems","author":"Mokhlissi,","year":"2017"},{"key":"2020072910570475500_B27","first-page":"197","article-title":"Complexity analysis of \u201csmall-world networks\u201d and spanning tree entropy","volume-title":"International Workshop on Complex Networks and their Applications","author":"Mokhlissi,","year":"2016"},{"key":"2020072910570475500_B28","doi-asserted-by":"crossref","first-page":"1450009","DOI":"10.1142\/S0217984914500092","article-title":"Applications of Laplacian spectra on a 3-prism graph","volume":"28","author":"Ding,","year":"2014","journal-title":"Mod. Phys. Lett. B"},{"key":"2020072910570475500_B29","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.laa.2009.08.028","article-title":"Determinant identities for Laplace matrices","volume":"432","author":"Teufl,","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"2020072910570475500_B30","doi-asserted-by":"crossref","first-page":"415001","DOI":"10.1088\/1751-8113\/43\/41\/415001","article-title":"On the number of spanning trees on various lattices","volume":"43","author":"Teufl,","year":"2010","journal-title":"J. Phys. A"},{"key":"2020072910570475500_B31","article-title":"Finite epidemic thresholds in fractal scale-free large-world\u2019networks","author":"Zhang,","year":"2008"},{"key":"2020072910570475500_B32","volume-title":"Mathematical Foundations and Applications of Graph Entropy","author":"Dehmer,","year":"2017"},{"key":"2020072910570475500_B33","volume-title":"Spanning Tree Results for Graphs and Multigraphs: A Matrix-theoretic Approach","author":"Gross,","year":"2015"},{"key":"2020072910570475500_B34","volume-title":"Introduction to Graph Theory","author":"Wilson,","year":"1979"},{"key":"2020072910570475500_B35","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley,","year":"1889","journal-title":"Quart. J. Math."},{"key":"2020072910570475500_B36","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1214\/aop\/1176989121","article-title":"Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances","volume":"21","author":"Burton,","year":"1993","journal-title":"Ann. Probab."},{"key":"2020072910570475500_B37","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":"Comb., Probab. Comput."},{"key":"2020072910570475500_B38","first-page":"65","article-title":"Counting spanning trees in prism and anti-prism graphs","volume":"6","author":"Sun,","year":"2016","journal-title":"J. Appl. Anal. Comput."},{"key":"2020072910570475500_B39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physa.2015.03.047","article-title":"Enumeration of spanning trees on contact graphs of disk packings","volume":"433","author":"Qin,","year":"2015","journal-title":"Physica A"},{"key":"2020072910570475500_B40","doi-asserted-by":"crossref","first-page":"68002","DOI":"10.1209\/0295-5075\/90\/68002","article-title":"Enumeration of spanning trees in a pseudofractal scale-free web","volume":"90","author":"Zhang,","year":"2010","journal-title":"EPL (Europhys. Lett.)"},{"key":"2020072910570475500_B41","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10955-006-9262-0","article-title":"Spanning trees on the Sierpinski gasket","volume":"126","author":"Chang,","year":"2007","journal-title":"J. Stat. Phys."},{"key":"2020072910570475500_B42","doi-asserted-by":"crossref","first-page":"L113","DOI":"10.1088\/0305-4470\/10\/6\/004","article-title":"Number of spanning trees on a lattice","volume":"10","author":"Wu,","year":"1977","journal-title":"J. Phys. A"},{"key":"2020072910570475500_B43","doi-asserted-by":"crossref","first-page":"3342","DOI":"10.1016\/j.physa.2012.01.039","article-title":"Counting spanning trees in a small-world Farey graph","volume":"391","author":"Zhang,","year":"2012","journal-title":"Physica A"},{"key":"2020072910570475500_B44","doi-asserted-by":"crossref","first-page":"1550021","DOI":"10.1142\/S0218348X15500218","article-title":"Enumeration of spanning trees on generalized pseudofractal networks","volume":"23","author":"Xiao,","year":"2015","journal-title":"Fractal"},{"key":"2020072910570475500_B45","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2008\/09\/P09008","article-title":"Fractal scale-free networks resistant to disease spread","volume":"2008","author":"Zhang,","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"2020072910570475500_B46","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1038\/nphys266","article-title":"Origins of fractality in the growth of complex networks","volume":"2","author":"Song,","year":"2006","journal-title":"Nat. Phys."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/2\/cnz030\/33543535\/cnz030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/8\/2\/cnz030\/33543535\/cnz030.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T09:15:31Z","timestamp":1695028531000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnz030\/5545536"}},"subtitle":[],"editor":[{"given":"Tiago","family":"Pereira","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnz030","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,4]]},"published":{"date-parts":[[2019,8,9]]},"article-number":"cnz030"}}