دوره 9، شماره 2 - ( 8-1393 )                   جلد 9 شماره 2 صفحات 45-64 | برگشت به فهرست نسخه ها

DOI: 10.7508/ijmsi.2014.02.005


XML Print


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى