摘要
设G是阶为n的2—连通图且δ(G)≥3.本文证明了:如果uv∈E(G蕴含)|N(u)∪N(v)|≥n-3则G是泛圈图,除非G≌K(3,3).
Suppose that G is 2-connected graph on n vertices and δ(G)≥3. In this paper we prove that if uv∈E(G) implies|N(u)∪N(v)|≥n-3, then G is pacyclic, unless n=6 and GK_(3,3).
关键词
邻集
2-连通图
泛圈图
证明
set
graph (mathe matics)
connected graphs
