On the number of spanning trees on various lattices

From MaRDI portal
Publication:3053181

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




Related Items (21)

Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer modelsThe spectrum and Laplacian spectrum of the dice latticeA class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical charactersEnumeration of spanning trees of 2-separable networksNew method for counting the number of spanning trees in a two-tree networkEntropy and enumeration of spanning connected unicyclic subgraphs in self-similar networkA method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networksThe critical group of a clique-inserted graphAn iteration method for computing the total number of spanning trees and its applications in graph theoryAn algorithm for delta-wye reduction of almost-planar graphsEnumeration of spanning trees in the sequence of Dürer graphsSpanning tree bounds for grid graphsCOUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHSEnumeration of spanning trees of middle graphsSome physical and chemical indices of clique-inserted latticesSome physical and chemical indices of the Union Jack latticeEnumeration of spanning trees in planar unclustered networksPotts model partition functions on two families of fractal latticesCounting spanning trees in self-similar networks by evaluating determinantsSpanning trees and dimer problem on the Cairo pentagonal latticeSpanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L






This page was built for publication: On the number of spanning trees on various lattices