A general method for computing Tutte polynomials of self-similar graphs

DOI10.1016/j.physa.2017.04.073zbMath1499.82007OpenAlexW2610113778MaRDI QIDQ2147865

Helin Gong, Xian'an Jin

Publication date: 20 June 2022

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

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

zbMATH Keywords

spanning treeTutte polynomialSierpiński gasketself-similarPotts model partition function

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Fractals (28A80)

Related Items

The Tutte polynomial of a class of compound graphs and its applications, Unnamed Item, Tutte polynomials of two self-similar network models, The behavior of Tutte polynomials of graphs under five graph operations and its applications

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tutte polynomial of scale-free networks
• The number of spanning trees in self-similar graphs
• Spanning trees on the Sierpinski gasket
• Tutte polynomial of pseudofractal scale-free web
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• A little statistical mechanics for the graph theorist
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
• Recursively constructible families of graphs
• Exact Potts model partition function on strips of the triangular lattice
• Potts model partition functions on two families of fractal lattices
• Improved bounds for the number of forests and acyclic orientations in the square lattice
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
• Recursive families of graphs
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• The Tower of Hanoi – Myths and Maths
• Exact Potts/Tutte polynomials for polygon chain graphs
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Enumeration of spanning trees on Apollonian networks
• Tutte polynomial of the Apollonian network
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• A Contribution to the Theory of Chromatic Polynomials
• Exact Potts model partition functions on wider arbitrary-length strips of the square lattice