关于无爪图最大团数的一个估计

Estimate on Maximum Clique Number of Claw-free Graph

设图 G=( V,E)是一个简单连通图 ,称所有同边 e关联的边集为 e的边邻集 ,记为 Γ( e) ,并称 | Γ( e) |为 e的边度 ,记为 d( e) .

If G is a simple connected graph,the set of edges adjacent to an edge e∈E(G) , or the edge neighbourhood of e ,is denoted by Γ(e) . The edge degree of e is d(e)=|Γ(e)| .In this paper,we present a sufficient and necessary condition on line graph.Moreover,we also estimate the bound value of maximum clique number in the claw free graph.