Counting spanning trees of a type of generalized Farey graphs

DOI10.1016/J.PHYSA.2020.124749OpenAlexW3029426330MaRDI QIDQ2139695FDOQ2139695

Authors: Jingyuan Zhang, Weigen Yan 

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)

Cites Work

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

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139695)