CHROMATIC AND CLIQUE NUMBERS OF A CLASS OF PERFECT GRAPHS

被引：0

作者：

Fander, Mohammad Reza ^{[1
]}

机构：

[1] Azad Univ, Chalus Branch, Sch Math, Chalus, Iran

来源：

TRANSACTIONS ON COMBINATORICS | 2015年 / 4卷 / 04期

关键词：

Perfect graph; clique number; chromatic number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let p be a prime number and n be a positive integer. The graph G(p)(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 not equal v and p inverted iota u + v. In this paper it is shown that G(p)(n) is a perfect graph. In addition, an explicit formula for the chromatic number of such graph is given.

引用

页码：1 / 4

页数：4