Tutte polynomial of the Apollonian network
From MaRDI portal
Publication:3301779
DOI10.1088/1742-5468/2014/10/P10043zbMath1456.05082OpenAlexW2026730646MaRDI QIDQ3301779
Xiao-Ling Shen, Yunhua Liao, Yao-Ping Hou
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1742-5468/2014/10/p10043
Related Items
The Tutte polynomials of catacondensed benzenoid systems, A general method for computing Tutte polynomials of self-similar graphs, Tutte polynomials of two self-similar network models, A survey and classification of Sierpiński-type graphs, Tutte polynomials of alternating polycyclic chains, Strong geodetic problem in networks
Cites Work
- Unnamed Item
- Weighted spanning trees on some self-similar graphs
- Farey graphs as models for complex networks
- A little statistical mechanics for the graph theorist
- Tutte polynomials and related asymptotic limiting functions for recursive 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
- Potts model partition functions on two families of fractal lattices
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- The number of spanning trees in Apollonian networks
- Exact Potts model partition functions for strips of the honeycomb lattice
- The Potts model and the Tutte polynomial
- The Tutte polynomial of the Sierpiński and Hanoi graphs
- Exact Potts/Tutte polynomials for polygon chain graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Properties and applications of Laplacian spectra for Koch networks
- Chromatic polynomials of planar triangulations, the Tutte upper bound and chromatic zeros
- Enumeration of spanning trees on Apollonian networks
- Potts models on hierarchical lattices and renormalization group dynamics: II. Examples and numerical results
- Towers of hanoi graphs
- On the computational complexity of the Jones and Tutte polynomials
- A Contribution to the Theory of Chromatic Polynomials
- Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
- Deterministic scale-free networks