Counting spanning trees of a type of generalized Farey graphs

DOI10.1016/j.physa.2020.124749OpenAlexW3029426330MaRDI QIDQ2139695

Weigen Yan, Jingyuan Zhang

Publication date: 19 May 2022

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

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

zbMATH Keywords

spanning treeFarey sequenceFarey graphgeneralized Farey graph

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (3)

Enumeration of subtrees of planar two-tree networks ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Matrix-tree theorem of digraphs via signless Laplacians

Cites Work

• Unnamed Item
• Farey graphs as models for complex networks
• Determinant identities for Laplace matrices
• Number of spanning trees in the sequence of some graphs
• Mapping Koch curves into scale-free small-world networks
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Farey Series and Maximal Outerplanar Graphs
• Isomorphism of dimer configurations and spanning trees on finite square lattices

This page was built for publication: Counting spanning trees of a type of generalized Farey graphs