AU - Lau, G.-C.
AU - Peng, Y.-H.
AU - Alikhani, S.
TI - Chromaticity of Turan Graphs with At Most Three Edges Deleted
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 9
VI - 2
IP - 2
4099 - http://ijmsi.ir/article-1-642-en.html
4100 - http://ijmsi.ir/article-1-642-en.pdf
SO - IJMSI 2
ABĀ - Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically 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.
CP - IRAN
IN -
LG - eng
PB - IJMSI
PG - 45
PT - Research paper
YR - 2014