Families of Graphs With Chromatic Zeros Lying on Circles
Robert Shrock, Shan-Ho Tsai
Abstract
We define an infinite set of families of graphs, which we call p-wheels and denote (Wh)(p)n, that generalize the wheel (p=1) and biwheel (p=2) graphs. The chromatic polynomial for (Wh)(p)n is calculated, and remarkably simple properties of the chromatic zeros are found: (i) the real zeros occur at q=0,1,...p+1 for n-p even and q=0,1,...p+2 for n-p odd; and (ii) the complex zeros all lie, equally spaced, on the unit circle |q-(p+1)|=1 in the complex q plane. In the n ∞ limit, the zeros on this circle merge to form a boundary curve separating two regions where the limiting function W(\(Wh)(p)\,q) is analytic, viz., the exterior and interior of the above circle. Connections with statistical mechanics are noted.
Create a lesson
Related papers
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits
Spectral optimization of spherical lattices and applications to classical and quantum interacting spin systems
Jonas Völler, Grigorios Makris, Fabian Hassler et al.
Entropic-ordered superfluid
Isabella Zane, Andrew Lucas