|
|
|
|
chromatic and clique numbers of a class of perfect graphs
|
|
|
|
|
|
|
|
نویسنده
|
FANDER MOHAMMAD REZA
|
|
منبع
|
transactions on combinatorics - 2015 - دوره : 4 - شماره : 4 - صفحه:1 -4
|
|
چکیده
|
Let p be a prime number and n be a positive integer. the graph gp(n) is a graph with vertex set [n] = {1, 2, . . . , n}, in which there is an arc from u to v if and only if u ̸= v and p ∤ u + v. in this paper it is shown that gp(n) is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.
|
|
کلیدواژه
|
perfect graph ,clique number ,chromatic number
|
|
آدرس
|
Azad University, Chalus Branch, School of Mathematics, ایران
|
|
پست الکترونیکی
|
mohamadrezafander@yahoo.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|