Structure of Independent Sets in Direct Products of Some Vertex-transitive Graphs

被引:0
作者
Xing Bo GENG [1 ]
Jun WANG [2 ]
Hua Jun ZHANG [3 ]
机构
[1] School of Mathematical Science, Dalian University of Technology
[2] Department of Mathematics, Shanghai Normal University
[3] Department of Mathematics, Zhejiang Normal University
关键词
Vertex-transitivity; primitivity; independence number;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
Let Circ( r, n) be a circular graph. It is well known that its independence number α(Circ(r, n)) = r. In this paper we prove that α(Circ(r, n) × H ) = max{r|H |, nα(H )} for every vertex transitive graph H, and describe the structure of maximum independent sets in Circ(r, n) × H. As consequences, we prove α(G × H ) = max{α(G)|V (H )|, α(H )|V (G)|} for G being Kneser graphs, and the graphs defined by permutations and partial permutations, respectively. The structure of maximum independent sets in these direct products is also described.
引用
收藏
页码:697 / 706
页数:10
相关论文
共 5 条
[1]  
A new proof of the Erd?s–Ko–Rado theorem for intersecting families of permutations[J] . Chris Godsil,Karen Meagher.European Journal of Combinatorics . 2008 (2)
[2]   Independence and coloring properties of direct products of some vertex-transitive graphs [J].
Valencia-Pabon, Mario ;
Vera, Juan .
DISCRETE MATHEMATICS, 2006, 306 (18) :2275-2281
[3]   Intersecting families of permutations [J].
Cameron, PJ ;
Ku, CY .
EUROPEAN JOURNAL OF COMBINATORICS, 2003, 24 (07) :881-890
[4]  
Graph products and the chromatic difference sequence of vertex-transitive graphs[J] . Claude Tardif.Discrete Mathematics . 1998 (1)
[5]  
An Erdo?s–Ko–Rado Theorem for Direct Products[J] . P. Frankl.European Journal of Combinatorics . 1996 (8)