The chromatic uniqueness of certain broken wheels (Q1182985): Difference between revisions

A graph \(G\) is chromatically unique if it is uniquely determined up to isomorphism by its chromatic polynomial. Let \(W(n,k)\) be the graph of order \(n\) formed by adding a new vertex adjacent to \(k\) consecutive vertices on an \((n-1)\)-cycle. It is known that \(W(n,1)\) and \(W(n,2)\) are chromatically unique for \(n\geq 4\), as are \(W(n,3)\) for \(n\geq 5\) and \(W(n,4)\) for \(n\geq 6\). However, \(W(7,5)\) is not chromatically unique. In this note the authors show that \(W(n,5)\) is chromatically unique for \(n\geq 8\).