The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial Σk=1nαk(G)x(x-1) ⋯(x-k+1) of degree n, where αk(G) is the number of k-independent partitions of G for all k. The adjoint polynomial of G is defined to be Σk=1nαk(Ḡ)x k, where Ḡ is the complement of G. We find explicit formulas for the adjoint polynomials of the bridgepath and bridgecycle graphs. Consequence, we find the zeros of the adjoint polynomials of several families of graphs.
- Adjoint polynomial
- Chebyshev polynomial
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics