an:00279604
Zbl 0774.05038
Dong, Fengming
On the uniqueness of the chromatic polynomials of generalized wheel graphs
ZH
J. Math. Res. Expo. 10, No. 3, 447-454 (1990).
00013992
1990
j
05C15
chromatic polynomial; wheel graphs; chromatically unique graphs
Summary: We prove that the generalized wheel graph \(\theta_{n,k}\) is chromatically unique if \(k\geq 0\) and \(n\geq 4\) is even. Meanwhile, it also has been proved that for a graph \(G\) we have \(P_ \lambda(G)=\lambda\cdots(\lambda-q+1)(\lambda-q)^{n-q}\) if and only if \(G\) is a \(q\)-tree on \(n\) vertices.