Some star extremal circulant graphs

被引:3
作者
Lin, WS [1 ]
机构
[1] Hong Kong Baptist Univ, Dept Math, Kowloon, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
circular chromatic number; fractional chromatic number; circulant graph; star extremal graph;
D O I
10.1016/S0012-365X(02)00872-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The circular chromatic number chi(c)(G) and the fractional chromatic number chi(f)(G) are two generalizations of the ordinary chromatic number of a graph G. A graph is called star extremal if its circular chromatic number equals its fractional chromatic number. Gao and Zhu (Discrete Math. 152 (1996) 147-156), Lih et al. (SIAM J. Discrete Math. 12 (1999) 491-499) gave many classes of circulant graphs which are star extremal. In this paper, we study the star extremality of circulant graphs whose generating sets are of the form {1,2,...,m - l,k,k+ 1,...,k+m -2}, {k,k + 1,....,k'} and {k,k + 1,....,k1,k2,k2 + 1,....,[p/2]} , where p is the vertex number of the graph. As a corollary, we give an improvement of a result of Gao and Zhu (Discrete Math. 152 (1996) 147-156). (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:169 / 177
页数:9
相关论文
共 19 条
[1]   HOMOMORPHISMS OF 3-CHROMATIC GRAPHS [J].
ALBERTSON, MO ;
COLLINS, KL .
DISCRETE MATHEMATICS, 1985, 54 (02) :127-132
[2]   A NOTE ON THE STAR CHROMATIC NUMBER [J].
BONDY, JA ;
HELL, P .
JOURNAL OF GRAPH THEORY, 1990, 14 (04) :479-482
[3]   Circular chromatic numbers and fractional chromatic numbers of distance graphs [J].
Chang, GJ ;
Huang, LL ;
Zhu, XD .
EUROPEAN JOURNAL OF COMBINATORICS, 1998, 19 (04) :423-431
[4]   Circular chromatic numbers of Mycielski's graphs [J].
Chang, GJ ;
Huang, LL ;
Zhu, XD .
DISCRETE MATHEMATICS, 1999, 205 (1-3) :23-37
[5]  
CHANG GJ, 2001, AMS IP STUD ADV MATH, V20, P497
[6]   Star-extremal graphs and the lexicographic product [J].
Gao, GG ;
Zhu, XD .
DISCRETE MATHEMATICS, 1996, 152 (1-3) :147-156
[7]   ACYCLIC GRAPH-COLORING AND THE COMPLEXITY OF THE STAR CHROMATIC NUMBER [J].
GUICHARD, DR .
JOURNAL OF GRAPH THEORY, 1993, 17 (02) :129-134
[8]  
Huang LL, 1999, J GRAPH THEOR, V32, P63, DOI 10.1002/(SICI)1097-0118(199909)32:1<63::AID-JGT6>3.0.CO
[9]  
2-B
[10]   Circular chromatic numbers of distance graphs with distance sets missing multiples [J].
Huang, LL ;
Chang, GJ .
EUROPEAN JOURNAL OF COMBINATORICS, 2000, 21 (02) :241-248