The evaluation of the number and the entropy of spanning trees on generalized small-world networks

DOI10.1155/2018/1017308zbMath1437.05048OpenAlexW2889374003WikidataQ129329544 ScholiaQ129329544MaRDI QIDQ1741668

Noussaima EL Khattabi, Raihana Mokhlissi, Dounia Lotfi, Joyati Debnath, Mohamed El Marraki

Publication date: 7 May 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/1017308

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao

Cites Work

• Unnamed Item
• Unnamed Item
• Entropy and the complexity of graphs revisited
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• The hierarchical product of graphs
• Matrix tree theorems
• New method for counting the number of spanning trees in a two-tree network
• Enumeration of spanning trees in planar unclustered networks
• Counting spanning trees in self-similar networks by evaluating determinants
• Mathematical Foundations and Applications of Graph Entropy
• Mapping Koch curves into scale-free small-world networks
• High-precision entropy values for spanning trees in lattices
• Spanning trees on graphs and lattices inddimensions
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Random walks on dual Sierpinski gaskets

This page was built for publication: The evaluation of the number and the entropy of spanning trees on generalized small-world networks