有关Hamilton图与连通度的一个充分条件

利用插点方法和H-序列，证明了如果G是n阶简单图，k=k（G）≥k≥2．而（a1，a2，…，ak＋1）是H-序列，若对于任意的Y∈Ik＋1^（e）（G），有∑i=1^k＋1aisi（Y）＋sk＋1（Y）〉n＋k＋k-3，则G是Hamilton-图,该定理也是对这方面已有的某些定理的有效推广。

One new sufficient condition for hamilton graphs

As a way for the masses to excise their democratic rights, broadening channels of public participation in the anti-corruption campaign is not only favorable to the successful expansion of anti-corruption campaign, but also an advantage to the development of socialist political civilization. Therefore we should make great efforts to promote the process of democratic construction so as to broaden the channels for the public participation. Meanwhile, construction of mechanism for the public participation in the anti-corruption campaign should be strengthened to bring the initiative and enthusiasm of the masses into full play.