Chromatic polynomials for families of strip graphs and their asymptotic limits

We calculate the chromatic polynomials P((G_s)_m,q) and, from these, the asymptotic limiting functions W({G_s},q) = lim_n→∞ P(G_s,q)^1/n for families of n-vertex graphs (G_s)_m comprised of m repeated subgraphs H adjoined to an initial graph I. These calculations of W({G_s},q) for infinitely long strips of varying widths yield important insights into properties of W(Λ,q) for two-dimensional lattices Λ. In turn, these results connect with statistical mechanics, since W(Λ,q) is the ground-state degeneracy of the g-state Potts model on the lattice Λ. For our calculations, we develop and use a generating function method, which enables us to determine both the chromatic polynomials of finite strip graphs and the resultant W({G_s},q) function in the limit n → ∞. From this, we obtain the exact continuous locus of points ℬ where W({G_s},q) is nonanalytic in the complex q plane. This locus is shown to consist of arcs which do not separate the q plane into disconnected regions. Zeros of chromatic polynomials are computed for finite strips and compared with the exact locus of singularities ℬ. We find that as the width of the infinitely long strips is increased, the arcs comprising ℬ elongate and move toward each other, which enables one to understand the origin of closed regions that result for the (infinite) 2D lattice.