简介:ForagraphG,P(G,λ)denotesthechromaticpolynomialofG.TwographsGandHaresaidtobechromaticallyequivalent,denotedbyG-H,ifP(G,λ)=p(H,λ).Let[G]={H|H-G}.If[G]={G},thenGissaidtobechromaticallyunique.Foracomplete5-partitegraphGwith5nvertices,defineθ(G)=(a(G,6)-2^n+1-2^n-1+5)/2n-2,wherea(G,6)denotesthenumberof6-independentpartitionsofG.Inthispaper,theauthorsshowthatθ(G)≥0anddetermineallgraphswithθ(G)=0,1,2,5/2,7/2,4,17/4.Byusingtheseresultsthechromaticityof5-partitegraphsoftheformG-Swithθ(G)=0,1,2,5/2,7/2,4,17/4isinvestigated,whereSisasetofedgesofG.Manynewchromaticallyunique5-partitegraphsareobtained.