Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials
The chromatic polynomial of a simple graph \(G\) with \(n>0\) vertices is a polynomial \[ \sum_{k=1}^{n}\alpha_k(G)x(x-1)\cdots(x-k+1) \] of degree \(n\), where \(\alpha_k(G)\) is the number of \(k\)-independent partitions of \(G\) for all \(k\). The adjoint polynomial is defined to \(\sum_{k=1}^{n}\alpha_k(\bar{G})x^k\), where \(\bar{G}\) is the complement of \(G\). In this paper, the author compute the adjoint polynomials of the bridge-path and bridge-cycle graphs. The author also compute the zeros of the adjoint polynomials of several families of graphs.
- scientific article; zbMATH DE number 1744096
- scientific article; zbMATH DE number 903124
- scientific article; zbMATH DE number 2108155
- Factorizations of adjoint polynomials of graphs of shape \({P^{S{G_\lambda}}}\) and chromatically equivalence of their complements
- Proof of adjoint factorizations and chromatic equivalence of graphs \(\rho_n^{G(i)}\bigcup G\) etc
- Chromaticity of the complements of paths and cycles
- scientific article; zbMATH DE number 4099332 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 1744096 (Why is no real title available?)
- scientific article; zbMATH DE number 3372067 (Why is no real title available?)
- On chromatic polynomials and the golden ratio
- The roots of the adjoint polynomials of a class of graphs
This page was built for publication: Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275400)
