Premium
Building fences around the chromatic coefficients
Author(s) -
Strickland Debra Mullins
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199711)26:3<123::aid-jgt2>3.0.co;2-t
Subject(s) - mathematics , combinatorics , chromatic scale , chromatic polynomial , graph , windmill graph , friendship graph , discrete mathematics , graph theory , line graph , graph power
Associated to each graph G is its chromatic polynomial f ( G , t ) and we associate to f ( G , t ) the sequence α ( G ) of the norms of its coefficients. A stringent partial ordering is established for such sequences. The main result is that for any graph G with q edges we have α ( R q ) ≤ α ( G ) ≤ α ( S q ), where R q and S q are specified graphs with q edges. This translates into a clearer view of allowable values and patterns in the chromatic coefficients. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 123–128, 1997