Coefficients of the Chromatic Polynomials of Connected Graphs

Coefficients of the Chromatic Polynomials of Connected Graphs

In this article, we provide some new results on the divisibility of certain coefficients of the chromatic polynomials of connected graphs, and characterize connected nonplanar graphs of order n that minimize the absolute values of coefficients of the chromatic polynomials. Moreover, we also present...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical combinatorics 2021-12, Vol.4, p.41-48
Hauptverfasser: Long, Shude, Cai, Junliang
Format: Artikel
Sprache:eng
Schlagworte:
Coefficients
Graphs
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article, we provide some new results on the divisibility of certain coefficients of the chromatic polynomials of connected graphs, and characterize connected nonplanar graphs of order n that minimize the absolute values of coefficients of the chromatic polynomials. Moreover, we also present a sufficient condition that a graph is planar in term of certain coefficients of its chromatic polynomial.
ISSN:1937-1055
1937-1047