Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/17659
Title: 
Authors: 
Subjects: 
Graph
Chromatic polynomial
Chromatic root
Ring of cliques
Issue Date: 
2011
Citation: 
Dong, F., Royle, G., & Wagner, D. (2011). Chromatic roots of a ring of four cliques. Electronic Journal of Combinatorics, 18(1): P151. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p151/pdf
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.
URI: 
ISSN: 
1077-8926 (online)
File Permission: 
Open
File Availability: 
With file
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
EJC-18-1-P151.pdf144.64 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s) 50

140
checked on Mar 28, 2023

Download(s) 50

49
checked on Mar 28, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.