关于n-可扩图的一些新充分条件  

New Sufficient Conditions for n-extendable Graphs

作　　者：林泓[1] 

机构地区：[1]集美大学理学院,福建厦门361021

出　　处：《集美大学学报（自然科学版）》2010年第6期475-477,共3页Journal of Jimei University：Natural Science

基　　金：福建省自然科学基金资助项目(2010J01008);黄慧贞集美大学学科建设基金资助项目

摘　　要：若图G包含一个经过G的每个顶点的圈,则称图G为Hamilton图.若一个连通图G有n条独立边,且任意n条独立边都可扩展为G的完美匹配,则称G为n-可扩图.利用判别Hamilton图的Fan-型条件和Chvatal-Erdos型条件,分别得到两个新的判别n-可扩图的充分条件.If a graph G contained a cycle which included every vertex of G,then G was called to be Hamiltonian.A graph G was called to be n-extendable if it containd a set of n independent edges and every set of n independent edges could be extended to a perfect matching of G.By using the Fan-type condition and Chvatal-Erdos condition for graphs to be Hamiltonian,two new sufficient conditions for graphs to be n-extendable were given.

关 键 词：N-可扩图 HAMILTON路 HAMILTON圈 

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