Beraha's Conjecture and Cyclic Graphs

The chromatic polynomial of a graph gives the number of ways to color the graph with colors, such that no pair of connected vertices shares the same color.
Beraha's conjecture (due to Tutte) says that for each , the Beraha number is the limit of roots of at least one family of chromatic polynomials.
This Demonstration shows that:
1) All cyclic graphs of odd order have a root of their chromatic polynomial equal to .
2) For even order , let be the root with largest real part and positive imaginary part, and let be the complex conjugate root (the chromatic polynomial has real coefficients so complex roots come in conjugate pairs). Then the sequences and converge to as .


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.