Potts model partition functions on two families of fractal lattices

DOI10.1016/j.physa.2014.07.047zbMath1395.82046OpenAlexW2093446045MaRDI QIDQ1783100

Xian'an Jin, Helin Gong

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2014.07.047

zbMATH Keywords

spanning treePotts modelTutte polynomialasymptotic growth constantconnected spanning subgraphthe modified Koch graph

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (7)

The Tutte polynomials of catacondensed benzenoid systems ⋮ Tutte polynomial of scale-free networks ⋮ A general method for computing Tutte polynomials of self-similar graphs ⋮ The Tutte polynomial of a class of compound graphs and its applications ⋮ Unnamed Item ⋮ Tutte polynomial of the Apollonian network ⋮ Tutte polynomials of alternating polycyclic chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some Tutte polynomial sequences in the square lattice
• The number of spanning trees in self-similar graphs
• Spanning trees on the Sierpinski gasket
• The difference Laplacian \(\Delta\) on the modified Koch curve
• Forests, colorings and acyclic orientations of the square lattice
• The integrated density of states for the difference Laplacian on the modified Koch graph
• Splitting formulas for Tutte polynomials
• Chip firing and the Tutte polynomial
• Recursively constructible families of graphs
• Exact Potts model partition function on strips of the triangular lattice
• The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs
• The Kauffman brackets for equivalence classes of links
• Improved bounds for the number of forests and acyclic orientations in the square lattice
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• The replacements of signed graphs and Kauffman brackets of link families
• The number of spanning trees in Apollonian networks
• Recursive families of graphs
• Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Exact Potts/Tutte polynomials for polygon chain graphs
• Mapping Koch curves into scale-free small-world networks
• On the number of spanning trees on various lattices
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Properties and applications of Laplacian spectra for Koch networks
• Polynomial Invariants of Graphs
• Brownian motion on nested fractals
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Growth of Self‐Similar Graphs
• Spanning trees on graphs and lattices inddimensions
• Self-organized critical state of sandpile automaton models
• Some exact results for spanning trees on lattices
• Asymptotic Enumeration of Spanning Trees
• A Contribution to the Theory of Chromatic Polynomials
• Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
• The Tutte polynomial for homeomorphism classes of graphs
• Expanded Koch networks: structure and trapping time of random walks

This page was built for publication: Potts model partition functions on two families of fractal lattices