A matrix method for chromatic polynomials

Abstract

The chromatic polynomials of certain families of graphs can be expressed in terms of the eigenspaces of a linear operator. The operator is represented by a matrix, which is referred to here as the compatibility matrix. In this paper complete sets of eigenfunctions are obtained for several related families, and the results are used to provide information about the location of the zeros of the associated chromatic polynomials. A number of uniform features are observed, and these are explained in terms of general properties of the underlying construction. © 2001 Academic Press.