For the prism (cyclic ladder) graphs
, the chromatic polynomial admits a four-branch transfer-matrix expansion
,
,
,
,
, with explicit polynomial amplitudes
. By the Beraha-Kahane-Weiss mechanism, accumulation of chromatic roots as
is confined to loci where two or more
References
[1]
Birkhoff, G.D. (1912) A Determinant Formula for the Number of Ways of Coloring a Map. TheAnnalsofMathematics, 14, 42-46. https://doi.org/10.2307/1967597
[2]
Tutte, W.T. (1954) A Contribution to the Theory of Chromatic Polynomials. CanadianJournalofMathematics, 6, 80-91. https://doi.org/10.4153/cjm-1954-010-9
[3]
Whitney, H. (1932) The Coloring of Graphs. TheAnnalsofMathematics, 33, 688-718. https://doi.org/10.2307/1968214
[4]
Beraha, S., Kahane, J. and Weiss, N.J. (1980) Limits of Chromatic Zeros of Some Families of Maps. JournalofCombinatorialTheory, SeriesB, 28, 52-65. https://doi.org/10.1016/0095-8956(80)90055-6
[5]
Biggs, N. (2001) A Matrix Method for Chromatic Polynomials. JournalofCombinatorialTheory, SeriesB, 82, 19-29. https://doi.org/10.1006/jctb.2000.2017
[6]
Biggs, N. (2002) Chromatic Polynomials and Representations of the Symmetric Group. LinearAlgebraandItsApplications, 356, 3-26. https://doi.org/10.1016/s0024-3795(01)00610-3
[7]
Shrock, R. (2001) Chromatic Polynomials and Their Zeros and Asymptotic Limits for Families of Graphs. DiscreteMathematics, 231, 421-446. https://doi.org/10.1016/s0012-365x(00)00336-8
[8]
Sokal, A.D. (2004) Chromatic Roots Are Dense in the Whole Complex Plane. Combinatorics, ProbabilityandComputing, 13, 221-261. https://doi.org/10.1017/s0963548303006023