On the number of spanning trees on various lattices

DOI10.1088/1751-8113/43/41/415001zbMath1251.05080OpenAlexW2092153036MaRDI QIDQ3053181

Elmar Teufl, Stephan G. Wagner

Publication date: 4 November 2010

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c8496c1dc7b83f3fe10d4b6f809ea863c4965b65

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models, The spectrum and Laplacian spectrum of the dice lattice, A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters, Enumeration of spanning trees of 2-separable networks, New method for counting the number of spanning trees in a two-tree network, 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 critical group of a clique-inserted graph, An iteration method for computing the total number of spanning trees and its applications in graph theory, An algorithm for delta-wye reduction of almost-planar graphs, Enumeration of spanning trees in the sequence of Dürer graphs, Spanning tree bounds for grid graphs, COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS, Enumeration of spanning trees of middle graphs, Some physical and chemical indices of clique-inserted lattices, Some physical and chemical indices of the Union Jack lattice, Enumeration of spanning trees in planar unclustered networks, Potts model partition functions on two families of fractal lattices, Counting spanning trees in self-similar networks by evaluating determinants, Spanning trees and dimer problem on the Cairo pentagonal lattice, Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L