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

DOI10.1016/J.PHYSA.2017.04.073MaRDI QIDQ2147865zbMATH OpenOpenAlexFDO

Authors Helin Gong, Xianan 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

Potts model partition functionself-similarSierpiński gasketspanning treeTutte polynomial

Mathematics Subject Classification ID

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

Recommendations

• Tutte polynomials of two self-similar network models
• The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs
• Tutte polynomial of scale-free networks
• Tutte polynomial of pseudofractal scale-free web
• The number of spanning trees in self-similar graphs

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A little statistical mechanics for the graph theorist
• Enumeration of spanning trees on Apollonian networks
• Exact Potts model partition function on strips of the triangular lattice
• Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
• Exact Potts/Tutte polynomials for polygon chain graphs
• Graph polynomials and their applications. I: The Tutte polynomial
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3076589 (Why is no real title available?)
• Improved bounds for the number of forests and acyclic orientations in the square lattice
• Potts model partition functions on two families of fractal lattices
• Recursive families of graphs
• Recursively constructible families of graphs
• Spanning trees on the Sierpinski gasket
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• The number of spanning trees in self-similar graphs
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
• Tutte polynomial of pseudofractal scale-free web
• Tutte polynomial of scale-free networks
• Tutte polynomial of the Apollonian network
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs

Cited in

(11)

• The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs
• Tutte polynomials of two self-similar network models
• The behavior of Tutte polynomials of graphs under five graph operations and its applications
• Enumeration problems for classes of self-similar graphs
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Tutte polynomial of scale-free networks
• Formulas for the computation of the Tutte polynomial of graphs with parallel classes
• The Tutte polynomial of a class of compound graphs and its applications
• Tutte polynomial of tensor product graph and its applications
• Tutte polynomials for some chemical polycyclic graphs
• Tutte polynomial of pseudofractal scale-free web

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: A general method for computing Tutte polynomials of self-similar graphs

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