Chromatic roots of prism graphs: Cassini geometry and a uniform finite-n bound
Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 99-113
DOI: 10.61091/jcmcc131-07 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Julian Allagan und 3 weiteren Autor:innen.
Abstract (Originalsprache)
For the prism graphs \(G_n=C_n\square P_2\), the chromatic polynomial has an explicit four-branch transfer-matrix expansion with polynomial eigenvalues and amplitudes. The Beraha-Kahane-Weiss (BKW) theorem then confines asymptotic root accumulation to equimodular ties and amplitude zeros. Here the only amplitude zeros are \(z=1\) and \(z=\frac{3\pm\sqrt5}{2}\), and a dominance check shows that none yields an isolated BKW limit point. A complete algebraic classification of the prism tie curves appears in [1]. The dominant quadratic-linear ties are recast here in a centered Cassini-type normal form, giving a product-of-distances interpretation together with explicit quartic implicit and centered polar equations. A global Rouché comparison also yields a uniform finite-\(n\) bound: every chromatic root of \(G_n\) satisfies \(|z|
Zitieren
APA
Allagan, J., Voloshin, V., Gao, W., & Deriglazov, V. (2026). Chromatic roots of prism graphs: Cassini geometry and a uniform finite-n bound. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 99-113. https://doi.org/10.61091/jcmcc131-07
Vancouver
Allagan J, Voloshin V, Gao W, Deriglazov V. Chromatic roots of prism graphs: Cassini geometry and a uniform finite-n bound. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:99-113. doi:10.61091/jcmcc131-07
BibTeX
@article{Allagan2026,
author = {Allagan, Julian and Voloshin, Vitaly and Gao, Weizheng and Deriglazov, Vladimir},
title = {Chromatic roots of prism graphs: Cassini geometry and a uniform finite-n bound},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {99--113},
doi = {10.61091/jcmcc131-07}
}
EUVIMED