Tutte polynomial of a small-world farey graph
arXiv:1310.2056 · doi:10.1209/0295-5075/104/38001
Abstract
In this paper, we find recursive formulas for the Tutte polynomial of a family of small-world networks: Farey graphs, which are modular and have an exponential degree hierarchy. Then, making use of these formulas, we determine the number of spanning trees, as well as the number of connected spanning subgraphs. Furthermore, we also derive exact expressions for the chromatic polynomial and the reliability polynomial of these graphs.
arXiv comment6 pages
References in corpus (7)
- Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models I. General Theory and Square-Lattice Chromatic Polynomial
- Distribution of sizes of erased loops for loop-erased random walks
- Farey Graphs as Models for Complex Networks
- Counting spanning trees in a small-world Farey graph
- Counting spanning trees in self-similar networks by evaluating determinants
- Potts model on recursive lattices: some new exact results
- Random Walks on Complex Networks