图中的生成闭迹

Spanning Circuis in Graph

本文得到了如下结果:设G是n≥3级简单图,δ(G)≥2,且G(?)K_(2,n-2))(n为奇数)。若对任意顶点不相交的两边e_0及e_1,d(e_0)+d(e_1)≥2n-2,则G有一个生成闭迹。

The main result is as follow: Let G be a simple graph of ordern n≥3, G(?)K_(2,n-2) (n odd).If d(e_0) +d(e_1)2n-2 for every pair of edge e_1 and e_2 such that V(e_1) V(e_2)=φ, then G cont-ain a S-Circuit.