In allusion to a large number of non-chromatically unique graphs
the chromaticity of a class of the dense graphs is studied by applying the properties of graph′s adjoint polynomial
minimum roots and character features.The chromatically equivalent classes of the dense graphs are completely characterized
and the chromatically unique sufficient and necessary condition of the graphs is obtained.The new tools and methods are provided for the chromaticity research of graphs.