Spanning trees and dimer problem on the Cairo pentagonal lattice

DOI10.1016/J.AMC.2018.05.012MaRDI QIDQ2335635zbMATH OpenOpenAlexWikidataFDO

Authors Shuli Li, Weigen Yan

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

asymptotic growth constantCairo pentagonal latticedimerentropyspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Dimers on the 3³ . 4² lattice
• Spanning trees on two-dimensional lattices with more than one type of vertex
• Spanning trees on graphs and lattices inddimensions
• Isomorphism of dimer configurations and spanning trees on finite square lattices
• scientific article; zbMATH DE number 1934398

Cites work

• Asymptotic Enumeration of Spanning Trees
• Choosing a spanning tree for the integer lattice uniformly
• Dimer problem in statistical mechanics-an exact result
• Dimers and amoebae
• Dimers on two types of lattices on the Klein bottle
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Enumerating spanning trees of graphs with an involution
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• On the number of spanning trees on various lattices
• Some physical and chemical indices of the Union Jack lattice
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Spanning trees on lattices and integral identities
• Spanning trees on the Sierpinski gasket
• Statistical Mechanics of Dimers on a Plane Lattice
• The number of spanning trees of plane graphs with reflective symmetry
• The spectrum and Laplacian spectrum of the dice lattice
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

Cited in

(3)

• The triangular kagomé lattices revisited
• Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models
• Geometric bounds for spanning tree entropy of planar lattice graphs

This page was built for publication: Spanning trees and dimer problem on the Cairo pentagonal lattice

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