Adjoint polynomials of bridgepath and bridgecycle graphs and Chebyshev polynomials

Toufik Mansour

doi:10.1016/j.disc.2011.04.022

Adjoint polynomials of bridgepath and bridgecycle graphs and Chebyshev polynomials

Toufik Mansour

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial Σ_k=1ⁿα_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=1ⁿα_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.

Original language	American English
Pages (from-to)	1778-1785
Number of pages	8
Journal	Discrete Mathematics
Volume	311
Issue number	16
DOIs	https://doi.org/10.1016/j.disc.2011.04.022
State	Published - 28 Aug 2011

Keywords

Adjoint polynomial
Bridgegraph
Chebyshev polynomial

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.04.022

Cite this

@article{87190726f3d940f996f0c225e3e014fd,

title = "Adjoint polynomials of bridgepath and bridgecycle graphs and Chebyshev polynomials",

abstract = "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.",

keywords = "Adjoint polynomial, Bridgegraph, Chebyshev polynomial",

author = "Toufik Mansour",

year = "2011",

month = aug,

day = "28",

doi = "10.1016/j.disc.2011.04.022",

language = "American English",

volume = "311",

pages = "1778--1785",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "16",

}

TY - JOUR

T1 - Adjoint polynomials of bridgepath and bridgecycle graphs and Chebyshev polynomials

AU - Mansour, Toufik

PY - 2011/8/28

Y1 - 2011/8/28

N2 - 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.

AB - 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.

KW - Adjoint polynomial

KW - Bridgegraph

KW - Chebyshev polynomial

UR - http://www.scopus.com/inward/record.url?scp=79959191461&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.04.022

DO - 10.1016/j.disc.2011.04.022

M3 - Article

SN - 0012-365X

VL - 311

SP - 1778

EP - 1785

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 16

ER -

Adjoint polynomials of bridgepath and bridgecycle graphs and Chebyshev polynomials

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this