Explicit Equimodular Curves for Prism-Graph Chromatic Polynomials and the Beraha-Kahane-Weiss Limit Set

Abstract

For the prism (cyclic ladder) graphs G n = C n P 2 , the chromatic polynomial admits a four-branch transfer-matrix expansion P( G n ,z )= j=0 3 α j ( z ) λ j ( z ) n , λ 0 ( z )= z 2 3z+3 , λ 1 ( z )=1z , λ 2 ( z )=3z , λ 3 ( z )=1 , with explicit polynomial amplitudes α j ( z ) . By the Beraha-Kahane-Weiss mechanism, accumulation of chromatic roots as n is confined to loci where two or more dominant eigenvalues tie in modulus, together with isolated points arising from vanishing dominant amplitudes. We give a complete real-algebraic description of these modulus-tie sets for the prism family, including closed-form Cartesian quartic equations for the quadratic-linear balances | z 2 3z+3 |=| z1 | and | z 2 3z+3 |=| z3 | . These identities replace plot-based equimodular boundaries with verifiable equations and allow direct symbolic certification of the dominance inequalities governing the BKW accumulation arcs. For comparison, we also recall the cycle family C n , whose nontrivial chromatic roots lie on the circle | z1 |=1 and are uniformly distributed in angle.

Share and Cite:

Allagan, J. , Voloshin, V. , Deriglazov, V. and Lopez-Bonilla, R. (2026) Explicit Equimodular Curves for Prism-Graph Chromatic Polynomials and the Beraha-Kahane-Weiss Limit Set. American Journal of Computational Mathematics, 16, 14-26. doi: 10.4236/ajcm.2026.161002.

1. Introduction

For a finite simple graph G=( V,E ) , the chromatic polynomial P( G,z ) counts proper vertex colorings when z is a nonnegative integer and extends uniquely to a monic polynomial of degree | V | with integer coefficients [1]-[3]. Its complex zeros, the chromatic roots, encode subtle structural information about G and have been studied extensively from combinatorial, analytic, and statistical-mechanical perspectives. A central theme is to describe the geometry and asymptotic distribution of these roots for natural recursive families of graphs.

Many such families { G n } admit a finite transfer-matrix representation

P( G n ,z )= j=1 m α j ( z ) λ j ( z ) n . (1)

In this setting, the Beraha-Kahane-Weiss (BKW) theorem [4] governs the limiting behavior of chromatic roots as n : accumulation is confined to loci where two or more eigenvalues tie in modulus while dominating all others, together with isolated points arising from the vanishing of a dominant amplitude. Thus, the limiting root set is determined by explicit modulus-tie equations supplemented by dominance inequalities. While such boundaries are often explored numerically, fully explicit real-algebraic descriptions remain rare.

In this paper, we provide an explicit real-algebraic verification of the equimodular geometry for the prism (cyclic ladder) graphs G n = C n P 2 . Beyond the standard transfer-matrix eigen-branch expansion, we derive closed Cartesian equations for the nontrivial modulus ties involving the quadratic branch λ 0 ( z )= z 2 3z+3 , including the quartic loci | λ 0 ( z ) |=| z1 | and | λ 0 ( z ) |=| z3 | , and we formulate the limiting set as a union of explicitly defined dominant subsets of these ties, together with isolated amplitude-zero points.

The prism family G n = C n P 2 , n3 , is the smallest natural example in which multibranch competition occurs. Using the transfer-matrix framework together with the symmetric-group reduction introduced by Biggs [5] [6], we obtain an explicit four-branch expansion of the form (1) and determine all associated modulus-tie sets. The distinguishing feature is a closed Cartesian description of the quadratic-linear equimodular loci, which appear as real-algebraic curves of degree four alongside the remaining elementary ties. These formulas replace plot-based boundaries with exact algebraic conditions and permit direct, symbolic verification of the dominance relations required by the BKW mechanism.

Viewed in parallel, cycles and prisms form complementary test cases. Cycles exhibit a single dominant branch, forcing all nontrivial chromatic roots onto the circle | z1 |=1 , while prisms mark the transition to higher-degree real-algebraic limit sets generated by competing eigenvalues. Making this transition explicit clarifies the geometric content of the BKW framework and provides a concrete template for the analysis of more complex recursive families.

The paper is organized as follows. Section 2 briefly revisits cycles, fixing notation and recalling the explicit root parametrization and limiting distribution. Section 3 develops the transfer-matrix formulation for prisms, derives the four-branch eigenvalue expansion, and gives a concrete real-algebraic description of the associated BKW limit set, including the quartic modulus-tie curves.

2. Cycles: Chromatic Polynomial and Explicit Roots

Cycles provide a canonical family in which the chromatic polynomial, its full root set, and the limiting root geometry admit closed forms.

They serve here as a reference case: a single dominant eigen-branch controls the asymptotic behavior, yielding an unambiguous accumulation set.

This sharply contrasts with the multibranch behavior encountered later for prisms.

Theorem 2.1 (Chromatic polynomial of cycles). For n3 ,

P( C n ,z )= ( z1 ) n + ( 1 ) n ( z1 )=( z1 )( ( z1 ) n1 + ( 1 ) n ). (2)

Proof. The identity follows by any standard method.

For instance, deletion-contraction on an edge eE( C n ) gives

P( C n ,z )=z ( z1 ) n1 P( C n1 ,z ),

and since P( C 3 ,z )=z( z1 )( z2 ) satisfies (2), induction completes the argument.

Equivalent derivations via endpoint constraints on paths or adjacency-matrix traces lead to the same polynomial identity and are omitted.

With the closed form fixed, the root structure follows immediately.

Theorem 2.2 (Explicit chromatic roots of cycles). Let n3 and set m=n1 . The roots of P( C n ,z ) consist of z=1 together with the m solutions of ( z1 ) m = ( 1 ) n+1 , given explicitly by

z k =1+η ω m k ,k=0,1,,m1, (3)

where ω m = e 2πi/m and

η={ 1, nodd, e iπ/m , neven.

Proof. This is immediate from the factorization in Theorem 2.1.

Corollary 2.3 (Root locus). All nontrivial chromatic roots of C n lie on the circle

Γ={ z:| z1 |=1 }.

Proof. Equation (3) gives | z k 1 |=1 .

Figure 1 illustrates this configuration for representative values of n . As n increases, the nontrivial roots form a rotated regular ( n1 ) -gon on Γ and converge to a uniform angular distribution.

The resulting geometry is rigid and fully determined by a single modulus constraint.

Figure 1. Chromatic roots of C n for n{ 5,6,8,13 } . All nontrivial roots lie on the circle | z1 |=1 and become uniformly distributed as n grows.

2.1. Cycle: Geometry of the Roots

We retain the indexing from Theorem 2.2.

Corollary 2.4 (Real and imaginary parts). Let n3 and set m=n1 . For each nontrivial chromatic root z k = a k +i b k ,

a k =1+cos( π( 2k+δ ) m ), b k =sin( π( 2k+δ ) m ), (4)

where δ=1 for even n and δ=0 for odd n .

Proof. Writing z k 1= e i θ k with θ k = π( 2k+δ )/m , Euler’s formula yields the result.

Thus, the translated roots z k 1 are equally spaced on the unit circle, with constant angular increment 2π/m .

Corollary 2.5 (Real roots and symmetry). The nontrivial chromatic roots of C n occur in complex conjugate pairs. They include 0 for all n3 , include 2 if and only if n is odd, and admit no other real values.

Proof. Real roots correspond to e i θ k { ±1 } . The value −1 occurs for all m , while +1 occurs precisely when n is odd.

Remark 2.6 All nontrivial chromatic roots of C n lie on Γ and hence in the rectangle 0( z )2 , | ( z ) |1 , with extremal points 0, 2, and 1±i .

This rigid geometry reflects the presence of a single dominant eigenvalue branch.

Beyond exact location, the roots of C n admit a simple asymptotic description: as n they become uniformly distributed on Γ, and the associated logarithmic potential is elementary. Since these facts are classical and not used later, we record them briefly for context.

2.2. Cycles: Equidistribution and Logarithmic Potential

The nontrivial roots of P( C n ,z ) form an equally spaced set on Γ, up to a parity-dependent rotation. Consequently, the empirical root measures converge weakly to the uniform probability measure on Γ.

Theorem 2.7 (Equidistribution). The measures μ n = 1 n z n δ z converge weakly to the uniform measure σ on Γ.

Proof. This follows directly from the explicit parametrization z k =1+η ω n1 k and standard Riemann-sum convergence.

Lemma 2.8 (Logarithmic potential). For all z ,

Γ log| zw |dσ( w ) = log + | z1 |.

Proof. By rotational symmetry, the integral reduces to a classical mean-value computation on the unit circle.

Theorem 2.9 (Potential convergence). For every z\{ 1 } ,

lim n 1 n log| P( C n ,z ) |= log + | z1 |.

Proof. The closed form P( C n ,z )= ( z1 ) n + ( 1 ) n ( z1 ) yields the result by a direct comparison of exponential rates in the regimes | z1 |<1 , | z1 |>1 , and | z1 |=1 .

For cycles, the BKW limit set reduces to a single circle. In more complex recursive families, multiple eigenvalue branches compete, and the limiting geometry is dictated by nontrivial modulus ties. This transition motivates the prism analysis that follows.

3. Prisms: Transfer Matrices and the Beraha-Kahane-Weiss Mechanism

3.1. Transfer-Matrix Formulation

Let G n = C n P 2 denote the prism (cyclic ladder) graph, viewed as n rungs joining two horizontal n -cycles. A transfer matrix arises by propagating a proper coloring rung-by-rung while maintaining distinct colors on each rung.

Definition 3.1 (Rung state space). Fix q0 and write [ q ]={ 1,2,,q } . Set

Ω q :={ ( a,b )[ q ]×[ q ]:ab },| Ω q |=q( q1 ),

so that rung i is encoded by the ordered pair ( c( u i ),c( v i ) ) Ω q .

The horizontal edges enforce c( u i+1 )c( u i ) and c( v i+1 )c( v i ) , while each rung enforces c( u i+1 )c( v i+1 ) , i.e., membership in Ω q .

Definition 3.2 (Transfer matrix). For q0 , define the matrix M( q ) indexed by Ω q by

M ( q ) ( a,b ),( a , b ) ={ 1, a a, b b, a b , 0, otherwise.

Figure 2. The prism graph G 8 = C 8 P 2 with 16 vertices and 24 edges. The graph consists of two concentric n -cycles (inner and outer) connected by n vertical edges (rungs). The Cartesian product structure C n P 2 reflects the natural decomposition into horizontal cycles and vertical paths.

Proposition 3.3 (Trace formula). For every n3 and every integer q0 ,

P( G n ,q )=tr( M ( q ) n ).

In particular, for fixed n the right-hand side is a polynomial in q agreeing with P( G n ,q ) on q , hence the identity extends to all z .

Proof. A proper q -coloring of G n corresponds to a cyclic sequence of states

( a 1 , b 1 )( a 2 , b 2 )( a n , b n )( a 1 , b 1 ),

where each transition satisfies a i+1 a i , b i+1 b i , and a i+1 b i+1 . These are precisely the closed walks of length n in the directed transition graph on Ω q with adjacency matrix M( q ) , counted by tr( M ( q ) n ) .

The eigen-branch expansion follows from the S q -symmetry given by relabeling colors.

Lemma 3.4 (Row-column subspace). Fix q0 and write T q :=M( q ) . Let W q be the subspace of functions f: Ω q of the form f( a,b )=g( a )+h( b ) with

i=1 q g( i )= i=1 q h( i )=0.

Then W q is T q -invariant and, for every ( a,b ) Ω q ,

( T q f )( a,b )=( ( q2 )g( a )+h( a ) )+( g( b )+( 2q )h( b ) ).

Equivalently, for each i[ q ] the pair ( g( i ),h( i ) ) is updated by

A q =( ( q2 ) 1 1 2q ),

whose eigenvalues are 1q and 3q , each yielding a ( q1 ) -dimensional mean-zero eigenspace in W q .

Proof. Fix ( a,b ) Ω q and write f( a , b )=g( a )+h( b ) . Summing over admissible successors ( a , b ) with a a , b b , a b gives

( T q f )( a,b )= a a b b a b g( a )+ a a b b a b h( b ).

For the g -sum, fix a and count admissible b . If a =b then b may be any element of [ q ]\{ b } , giving q1 choices; if a { a,b } then b must avoid { b, a } , giving q2 choices. Hence

a a b b a b g( a )=( q1 )g( b )+( q2 ) a a,b g( a )=( q2 )g( a )+g( b ),

using g =0 . By symmetry, the h -sum equals h( a )+( 2q )h( b ) , yielding the stated formula.

Finally,

det( A q λI )= ( λ+q2 ) 2 1,

so the eigenvalues are 1q and 3q . Each eigendirection in 2 , together with the mean-zero condition, contributes a ( q1 ) -dimensional eigenspace in W q .

We now identify the spectrum relevant to the trace.

Theorem 3.5 (Eigenvalue expansion). There exist four eigenvalue branches

λ 0 ( z )= z 2 3z+3, λ 1 ( z )=1z, λ 2 ( z )=3z, λ 3 ( z )=1, (5)

with polynomial amplitudes

α 0 ( z )=1, α 1 ( z )=z1, α 2 ( z )=z1, α 3 ( z )= z 2 3z+1, (6)

such that for all n3 and all z ,

P( G n ,z )= j=0 3 α j ( z ) λ j ( z ) n . (7)

Proof. Work first at integer inputs z=q with q4 , then extend by polynomial identity.

Fix q4 and set V q = Ω q . Let T q be the operator with matrix M( q ) , so tr( M ( q ) n )=tr( T q n ) by Proposition 3.3. The symmetric group S q acts on Ω q by relabeling colors and commutes with T q , hence V q decomposes into S q -isotypic components on which T q acts scalarly.

On the fixed line 1 , each state ( a,b ) has ( q1 ) 2 ( q2 )= q 2 3q+3 admissible successors, so T q 1=( q 2 3q+3 )1 and λ 0 ( q )= q 2 3q+3 .

The S q -stable subspace W q from Lemma 3.4 has dimension 2( q1 ) and splits into eigenspaces with eigenvalues λ 1 ( q )=1q and λ 2 ( q )=3q , each of multiplicity q1 .

Let U q be an S q -stable complement of span{ 1 } W q . Then dim( U q )=q( q1 )12( q1 )= q 2 3q+1 . Choosing distinct a,b,c,d[ q ] and

ϕ:= e ( a,b ) e ( a,c ) e ( d,b ) + e ( d,c ) ,

one has ϕ1 and ϕ W q , hence ϕ U q . A direct transition check gives T q ϕ=ϕ , so λ 3 ( q )=1 on U q .

Further, the ordered-pair permutation representation of S q on Ω q has exactly these four isotypic constituents [6]. Therefore

tr( M ( q ) n )= ( q 2 3q+3 ) n +( q1 ) ( 1q ) n +( q1 ) ( 3q ) n +( q 2 3q+1 ),

which matches (7) upon rewriting in terms of λ j ( q ) and α j ( q ) . For fixed n , both sides are polynomials in q that agree for all integers q4 , hence are identical; evaluating at q=z gives (7) for all z .

Remark 3.6 (Closed form and consistency checks). Substituting (5) and (6) into (7) yields

P( G n ,z )= ( z 2 3z+3 ) n +( z1 )( ( 1z ) n + ( 3z ) n )+( z 2 3z+1 ). (8)

In particular, P( G n ,0 )=P( G n ,1 )=0 for all n3 . Small- n expansions provide checks only; the identity (7) is forced by the trace formula together with the S q -reduction producing the four eigen-branches.

3.2. The Beraha-Kahane-Weiss Mechanism

The representation (7) is a finite exponential sum in n . Consequently, root accumulation can occur only where at least two branches tie in modulus at the dominant scale, or at isolated points where a uniquely dominant branch has vanishing amplitude. The Beraha-Kahane-Weiss theorem makes this localization precise.

Theorem 3.7 (BKW accumulation set for prism chromatic roots). Let be the set of accumulation points in of chromatic roots of the prism family { G n } n3 . With

P( G n ,z )= j=0 3 α j ( z ) λ j ( z ) n

as in Theorem 3.5, define

:= 0i<j3 { z:| λ i ( z ) |=| λ j ( z ) |= max k | λ k ( z ) | } , (9)

A:={ z:jwith| λ j ( z ) |> max ij | λ i ( z ) |and α j ( z )=0 }. (10)

Then:

1) A .

2) If z 0 satisfies

| λ i ( z 0 ) |=| λ j ( z 0 ) |> max k{ i,j } | λ k ( z 0 ) |,

α i ( z 0 ) α j ( z 0 )0 , and λ i / λ j is not locally constant near z 0 , then z 0 .

For the prism branches (5), the elementary tie loci are

C 12 ={ z:| 1z |=| 3z | }={ z:( z )=2 }, (11)

C 13 ={ z:| 1z |=1 }={ z:| z1 |=1 }, (12)

C 23 ={ z:| 3z |=1 }={ z:| z3 |=1 }, (13)

C 03 ={ z:| z 2 3z+3 |=1 }. (14)

The amplitude zeros are

{ z: α 1 ( z )=0 }={ z: α 2 ( z )=0 }={ 1 },{ z: α 3 ( z )=0 }={ 3± 5 2 }. (15)

Thus, on any subset of a tie locus where exactly two branches dominate and the tied amplitudes are nonzero, the points belong to by (ii).

Proof. (i) Fix z 0 and assume a unique index j 0 satisfies

| λ j 0 ( z 0 ) |> max i j 0 | λ i ( z 0 ) |and α j 0 ( z 0 )0.

By continuity, there exists a neighborhood U of z 0 and constants c>0 and ρ( 0,1 ) such that | α j 0 ( z ) |c and | λ i ( z ) |ρ | λ j 0 ( z ) | for all zU and i j 0 . Factoring the dominant branch gives

P( G n ,z )= α j 0 ( z ) λ j 0 ( z ) n ( 1+ R n ( z ) ), R n ( z ):= i j 0 α i ( z ) α j 0 ( z ) ( λ i ( z ) λ j 0 ( z ) ) n .

On U one has | R n ( z ) |C ρ n uniformly for some C>0 , hence 1+ R n ( z )0 on U for all sufficiently large n . Thus z 0 cannot be an accumulation point of zeros, proving A .

(ii) Let z 0 with exactly two dominant branches ij and α i ( z 0 ) α j ( z 0 )0 . Shrinking to a neighborhood where all remaining branches are uniformly subdominant, write

P( G n ,z )= λ j ( z ) n ( α j ( z )+ α i ( z ) ( λ i ( z ) λ j ( z ) ) n + R ˜ n ( z ) ),| R ˜ n ( z ) |C ρ n ,

uniformly for some ρ( 0,1 ) . Since λ i / λ j is analytic and not locally constant, its argument varies in every neighborhood of z 0 , and the two leading terms attain near-opposition for infinitely many n . The standard BKW argument for exponential sums then yields zeros of P( G n , ) arbitrarily close to z 0 for arbitrarily large n , hence z 0 .

Finally, (11)-(14) and (15) follow by direct substitution from (5) and (6).

We now specialize the Beraha-Kahane-Weiss description to the explicit prism eigen-branches, isolating the subsets that can contribute to the limiting chromatic root set.

Corollary 3.8 (Prism limiting set). Let λ 0 , λ 1 , λ 2 , λ 3 and α 0 , α 1 , α 2 , α 3 be as in Theorem 3.5. For 0i<j3 define

ij :={ z:| λ i ( z ) |=| λ j ( z ) | max k{ i,j } | λ k ( z ) |, α i ( z ) α j ( z )0 }

and define

A:={ z:jwith| λ j ( z ) |> max ij | λ i ( z ) |and α j ( z )=0 }.

Then

( 0i<j3 ij )A.

Moreover, if z 0 ij is a point at which exactly the two branches i,j are dominant and λ i / λ j is not locally constant near z 0 , then z 0 .

This is an immediate specialization of Theorem 3.7 to the eigenvalues (5) and amplitudes (6), with the dominance conditions made explicit.

3.3. Quartic Ties Involving the Quadratic Branch λ 0

For G n = C n P 2 the eigen-branch expansion in Theorem 3.5 reads

P( G n ,z )= j=0 3 α j ( z ) λ j ( z ) n , λ 0 ( z )= z 2 3z+3, λ 1 ( z )=1z, λ 2 ( z )=3z, λ 3 ( z )=1.

The ties among λ 1 , λ 2 , λ 3 are elementary:

C 13 ={ | z1 |=1 }, C 23 ={ | z3 |=1 }, C 12 ={ ( z )=2 },

and together with C 03 ={ | λ 0 ( z ) |=1 } they account for all ties involving λ 3 . The remaining balances tie λ 0 with λ 1 or λ 2 and yield quartic real-algebraic curves.

Theorem 3.9 (Quartic modulus ties for λ 0 ). Let z=x+iy with x,y , and set

λ 0 ( z )= z 2 3z+3, λ 1 ( z )=1z, λ 2 ( z )=3z.

The modulus-tie sets

C 01 :={ z:| λ 0 ( z ) |=| λ 1 ( z ) | }, C 02 :={ z:| λ 0 ( z ) |=| λ 2 ( z ) | }

are quartic real-algebraic curves given by

C 01 : ( x 2 y 2 3x+3 ) 2 + y 2 ( 2x3 ) 2 = ( x1 ) 2 + y 2 , (16)

C 02 : ( x 2 y 2 3x+3 ) 2 + y 2 ( 2x3 ) 2 = ( x3 ) 2 + y 2 . (17)

Proof. Writing z=x+iy gives

λ 0 ( z )=( x 2 y 2 3x+3 )+iy( 2x3 ),

so

| λ 0 ( z ) | 2 = ( x 2 y 2 3x+3 ) 2 + y 2 ( 2x3 ) 2 .

Since | λ 1 ( z ) | 2 = ( x1 ) 2 + y 2 and | λ 2 ( z ) | 2 = ( x3 ) 2 + y 2 , the equalities | λ 0 |=| λ 1 | and | λ 0 |=| λ 2 | are equivalent to (16) and (17). Each is polynomial in ( x,y ) and has total degree four.

Corollary 3.10 (Basic properties). The quartic curves C 01 and C 02 satisfy:

1) C 01 ={ 2 } , with even intersection multiplicity;

2) C 02 ={ 0,2 } ;

3) both curves are invariant under complex conjugation.

Proof. Setting y=0 in (16) gives ( x 2 3x+3 ) 2 = ( x1 ) 2 , hence x 2 3x+3=±( x1 ) . The + sign yields ( x2 ) 2 =0 ; the − sign yields x 2 2x+2=0 with no real solutions. Thus C 01 ={ 2 } with even multiplicity.

Setting y=0 in (17) gives ( x 2 3x+3 ) 2 = ( x3 ) 2 , hence x 2 3x+3=±( x3 ) . The − sign yields x( x2 )=0 , giving { 0,2 } ; the + sign has no real solutions. Both equations depend on y only via y 2 , so they are invariant under conjugation.

Remark 3.11 (Dominance on quartic ties). On C 01 we have | λ 0 |=| λ 1 |=| z1 | . The linear comparison

| z3 | 2 | z1 | 2 =4( 1( z ) )

implies that for every z C 01 with ( z )1 , | z3 || z1 |=| λ 0 | , so λ 0 cannot be strictly dominant there. On C 02 we have | λ 0 |=| λ 2 |=| z3 | , and

| z1 | 2 | z3 | 2 =4( ( z )2 )

implies that for every z C 02 with ( z )2 , | z1 || z3 |=| λ 0 | , again excluding strict dominance of λ 0 on that portion. In these regions the quartic ties cannot contribute to accumulation arcs.

Equations (16) (17) also sharpen the tie geometry beyond what contour plots alone resolve: tangencies and near-intersections can be checked algebraically, and the dominance inequalities can be verified directly without relying on numerical resolution.

4. Conclusion

Cycles and prisms illustrate a sharp transition in chromatic-root geometry, from a single dominant eigen-branch to multibranch competition governed by the Beraha-Kahane-Weiss mechanism. For cycles C n , the explicit factorization of P( C n ,z ) confines all nontrivial roots to the circle | z1 |=1 and yields a uniform angular limiting distribution. For prisms G n = C n P 2 , the transfer-matrix formulation produces a four-branch eigenvalue expansion, placing the limiting root set under precise BKW control.

For the prism family, we give an explicit real-algebraic description of all equimodular boundaries. In addition to the elementary ties among the linear and constant branches, we derive closed Cartesian quartic equations for the quadratic-linear balances.

| z 2 3z+3 |=| z1 |and| z 2 3z+3 |=| z3 |.

These identities replace plot-based boundaries with exact algebraic conditions and allow direct verification of the dominance inequalities that determine which portions of the tie loci contribute to the BKW accumulation set.

Figure 3. Modulus-tie curves for G n = C n P 2 . Dashed curves indicate dominant BKW accumulation arcs; dotted curves are subdominant. Squares show roots for n = 6, 8, 10.

More broadly, prism graphs provide a compact setting in which the full equimodular geometry can be made explicit. The same combination of transfer-matrix reduction, algebraic elimination of modulus ties, and dominance analysis applies to wider cylindrical ladders C n P m and to other recursive families, where additional eigen-branches are expected to generate richer real-algebraic limit sets [7] [8]. Extending these techniques offers a systematic route toward rigorous, computation-assisted descriptions of chromatic-root accumulation geometry beyond the cases accessible by numerical exploration alone.

Funding

This work was supported by the U.S. Department of Education under grant number P382G240006.

Acknowledgement

The authors thank the anonymous reviewers for their helpful suggestions and careful reading of the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Birkhoff, G.D. (1912) A Determinant Formula for the Number of Ways of Coloring a Map. The Annals of Mathematics, 14, 42-46.[CrossRef]
[2] Tutte, W.T. (1954) A Contribution to the Theory of Chromatic Polynomials. Canadian Journal of Mathematics, 6, 80-91.[CrossRef]
[3] Whitney, H. (1932) The Coloring of Graphs. The Annals of Mathematics, 33, 688-718.[CrossRef]
[4] Beraha, S., Kahane, J. and Weiss, N.J. (1980) Limits of Chromatic Zeros of Some Families of Maps. Journal of Combinatorial Theory, Series B, 28, 52-65.[CrossRef]
[5] Biggs, N. (2001) A Matrix Method for Chromatic Polynomials. Journal of Combinatorial Theory, Series B, 82, 19-29.[CrossRef]
[6] Biggs, N. (2002) Chromatic Polynomials and Representations of the Symmetric Group. Linear Algebra and Its Applications, 356, 3-26.[CrossRef]
[7] Shrock, R. (2001) Chromatic Polynomials and Their Zeros and Asymptotic Limits for Families of Graphs. Discrete Mathematics, 231, 421-446.[CrossRef]
[8] Sokal, A.D. (2004) Chromatic Roots Are Dense in the Whole Complex Plane. Combinatorics, Probability and Computing, 13, 221-261.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.