Publication:
Chromatic roots of a ring of four cliques

Thumbnail Image
Files
EJC-18-1-P151.pdf(144.64 KB)
Date
2011
Authors
Dong, F. M.
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Abstract
For any positive integers a, b, c, d, let Ra,b,c,d be the graph obtained from the complete graphs Ka,Kb,Kc and Kd by adding edges joining every vertex in Ka and Kc to every vertex in Kb and Kd. This paper shows that for arbitrary positive integers a, b, c and d, every root of the chromatic polynomial of Ra,b,c,d is either a real number or a non-real number with its real part equal to (a + b + c + d − 1)/2.
Description
Keywords
Graph, Chromatic polynomial, Chromatic root, Ring of cliques
Citation
Dong, F. M., Royle, G., & Wagner, D. (2011). Chromatic roots of a ring of four cliques. Electronic Journal of Combinatorics, 18(1), Article P151. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p151/pdf
URI
https://hdl.handle.net/10497/17659
Collections
Journal Articles