دوره 9، شماره 2 - ( 8-1393 )
جلد 9 شماره 2 صفحات 64-45 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Lau G, Peng Y, Alikhani S. Chromaticity of Turan Graphs with At Most Three Edges Deleted. IJMSI 2014; 9 (2) :45-64
URL: http://ijmsi.ir/article-1-642-fa.html
URL: http://ijmsi.ir/article-1-642-fa.html
Chromaticity of Turan Graphs with At Most Three Edges Deleted. مجله علوم ریاضی و انفورماتیک. 1393; 9 (2) :45-64
چکیده:
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.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
