GRAPHS WHOSE CIRCULAR CLIQUE NUMBER EQUAL THE CLIQUE NUMBER  

作　　者：XUBaogang ZHOUXinghe 

机构地区：[1]SchoolofMathematics&ComputerScience,NanjingNormalUniversity,NinghaiRoad122,Nanjing210097,China

出　　处：《Journal of Systems Science & Complexity》2005年第3期340-346,共7页系统科学与复杂性学报（英文版）

基　　金：This research is supported partially by the National Natural Science Foundation of China(10371055).

摘　　要：The circular clique number of a graph G is the maximum fractional k/d suchthat G_d^k admits a homomorphism to G. In this paper, we give some sufficient conditions for graphswhose circular clique number equal the clique number, we also characterize the K_(1,3)-free graphsand planar graphs with the desired property.

关 键 词：circular clique number clique number GRAPH 

分 类 号：O157.5[理学—数学]