Adjoint polynomials of bridge–path and bridge–cycle graphs and Chebyshev polynomials |
| |
Authors: | Toufik Mansour |
| |
Affiliation: | aDepartment of Mathematics, University of Haifa, 31905 Haifa, Israel |
| |
Abstract: | The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial 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 , where is the complement of G. We find explicit formulas for the adjoint polynomials of the bridge–path and bridge–cycle graphs. Consequence, we find the zeros of the adjoint polynomials of several families of graphs. |
| |
Keywords: | Adjoint polynomial Bridge&ndash graph Chebyshev polynomial |
本文献已被 ScienceDirect 等数据库收录! |
|