Chromaticity of Turan Graphs with At Most Three Edges Deleted

Author(s):

G.-C. Lau , Y.-H. Peng , S. Alikhani

Message:
Abstract:
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.
Keywords:

Chromatic polynomial , Chromatic uniqueness , Turan graph

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:9 Issue: 2, Nov 2014
Pages:
45 to 64
https://www.magiran.com/p1329591  
مقالات دیگری از این نویسنده (گان)