Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network

DOI10.1016/j.physa.2021.126772OpenAlexW4200598956MaRDI QIDQ2669319

Yanyan Li

Publication date: 9 March 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2021.126772

zbMATH Keywords

entropy\((x, y)\)-flower networknumber of spanning connected unicyclic subgraphs

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance scaling and the number of spanning trees in self-similar lattices
• The number of spanning trees in self-similar graphs
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• New method for counting the number of spanning trees in a two-tree network
• The number of spanning trees of a family of 2-separable weighted graphs
• Enumeration of spanning trees of 2-separable networks
• Counting spanning trees in self-similar networks by evaluating determinants
• Mapping Koch curves into scale-free small-world networks
• On the number of spanning trees on various lattices
• Constructions and properties of a class of random scale-free networks
• Counting Minimum Weight Spanning Trees
• An ensemble of random graphs with identical degree distribution
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network