Enumeration of spanning trees of 2-separable networks

DOI10.1016/j.physa.2019.04.113OpenAlexW2946725775MaRDI QIDQ2164266

Tianyu Li, Weigen Yan

Publication date: 12 August 2022

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

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

zbMATH Keywords

enumeration problemspanning tree2-separable networks

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (5)

Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ The Tutte polynomial of a class of compound graphs and its applications ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees on the Sierpinski gasket
• Determinant identities for Laplace matrices
• The number of spanning trees of a family of 2-separable weighted graphs
• On the number of spanning trees on various lattices
• Spanning trees on graphs and lattices inddimensions
• Some exact results for spanning trees on lattices
• Spanning trees on lattices and integral identities
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Enumeration of spanning trees of 2-separable networks