Author/Authors :
Lau، Gee-Choon نويسنده Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM) 40450 Shah Alam, Selangor, Malaysia. , , Peng، Yee Hock نويسنده Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia , , Alikhani ، Saeid نويسنده Department of Mathematics, ,
Abstract :
Let $P(G,\lambda)$ be
the chromatic polynomial of a graph $G$. A graph $G$ is
chromatically unique if for any graph $H$, $P(H, \lambda) = P(G,
\lambda)$ implies $H$ is isomorphic to $G$. In this paper, we
determine the chromaticity of all Tur\ʹ{a}n graphs with at most
three edges deleted. As a by product, we found many families of
chromatically unique graphs and chromatic equivalence classes of
graphs.
