Summary: For any positive integers \(a, b, c, d\), let \(R_{a,b,c,d}\) be the graph obtained from the complete graphs \(K_a,\, K_b,\, K_c\) and \(K_d\) by adding edges joining every vertex in \(K_a\) and \(K_c\) to every vertex in \(K_b\) and \(K_d\). This paper shows that for arbitrary positive integers \(a, b, c\) and \(d\), every root of the chromatic polynomial of \(R_{a,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\).
Recommendations
Cited in
(6)- p-adic roots of chromatic polynomials
- A dense set of chromatic roots which is closed under multiplication by positive integers
- scientific article; zbMATH DE number 773170 (Why is no real title available?)
- Clique roots of K₄-free chordal graphs
- Roots of chromatic polynomials
- Resistance between two nodes of a ring clique network
This page was built for publication: Chromatic roots of a ring of four cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554005)
