• Media type: E-Article
  • Title: Chromatic Roots of a Ring of Four Cliques
  • Contributor: Dong, F. M.; Royle, Gordon; Wagner, Dave
  • imprint: The Electronic Journal of Combinatorics, 2011
  • Published in: The Electronic Journal of Combinatorics
  • Language: Not determined
  • DOI: 10.37236/638
  • ISSN: 1077-8926
  • Keywords: Computational Theory and Mathematics ; Geometry and Topology ; Theoretical Computer Science ; Applied Mathematics ; Discrete Mathematics and Combinatorics
  • Origination:
  • Footnote:
  • Description: <jats:p>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$. </jats:p>
  • Access State: Open Access