Iranian Journal of Mathematical Sciences and Informatics
مجله علوم ریاضی و انفورماتیک
IJMSI
Basic Sciences
http://ijmsi.ir
1
admin
1735-4463
2008-9473
8
10.61186/ijmsi
14
8888
13
en
jalali
1393
8
1
gregorian
2014
11
1
9
2
online
1
fulltext
en
Chromaticity of Turan Graphs with At Most Three Edges Deleted
عمومى
General
پژوهشي
Research paper
<p>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.</p>
Chromatic polynomial, Chromatic uniqueness, Turan graph.
45
64
http://ijmsi.ir/browse.php?a_code=A-10-583-3&slc_lang=en&sid=1
G.-C.
Lau
laugc@johor.uitm.edu.my
10031947532846002299
10031947532846002299
No
Y.-H.
Peng
yhpeng@fsas.upm.edu.my
10031947532846002300
10031947532846002300
No
S.
Alikhani
alikhani@yazd.ac.ir
10031947532846002301
10031947532846002301
Yes