Chromatic Polynomials and Orbital Chromatic Polynomials and their Roots
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is the number of proper k colorings of the graph. We can then find the orbital chromatic polynomial of a graph and a group of automorphisms of the graph, which is a polynomial whose value at a positive...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2015
|
| Subjects: | |
| Online Access: | http://scholarship.claremont.edu/hmc_theses/92 http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1069&context=hmc_theses |