Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials (Q2275400): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.04.022 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2123812269 / rank | |||
Normal rank |
Revision as of 03:16, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials |
scientific article |
Statements
Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials (English)
0 references
8 August 2011
0 references
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.
0 references
adjoint polynomial
0 references
bridge graph
0 references
chebyshev polynomial
0 references