Spanning trees and dimer problem on the Cairo pentagonal lattice

DOI10.1016/j.amc.2018.05.012zbMath1427.05109OpenAlexW2806716698WikidataQ129757007 ScholiaQ129757007MaRDI QIDQ2335635

Weigen Yan, Shuli Li

Publication date: 15 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.05.012

zbMATH Keywords

entropyspanning treedimerasymptotic growth constantCairo pentagonal lattice

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models

Cites Work

• Unnamed Item
• The spectrum and Laplacian spectrum of the dice lattice
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• Enumerating spanning trees of graphs with an involution
• Choosing a spanning tree for the integer lattice uniformly
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Dimers and amoebae
• The number of spanning trees of plane graphs with reflective symmetry
• The statistics of dimers on a lattice
• On the number of spanning trees on various lattices
• Statistical Mechanics of Dimers on a Plane Lattice
• Some physical and chemical indices of the Union Jack lattice
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Spanning trees on graphs and lattices inddimensions
• Dimers on two types of lattices on the Klein bottle
• Dimer problem in statistical mechanics-an exact result
• Spanning trees on lattices and integral identities
• Asymptotic Enumeration of Spanning Trees