摘要
研究几乎正则图的Hamilton性,得到了定理1 设G是2连通的(k,k+1)图,并且k≥V(G)3+13,如果G是偶数阶的图,则G是Hamilton图.定理2 设G是(k,k+2)图,并且k≥n3+103,如果存在G的一个非空独立集B1,使得B1≥n3-133,而且对于G的所有独立集B,都有B≤n2-1,则G是Hamilton图.
We study the properties of Hamiltonian of almost-regular graphs, and obtain Theorem 1 and Theorem 2.Theorem 1Let G be a 2-connected (k, k+1)-graph with k≥V(G)3+13. If G is a graph of even order, then G is Hamiltonian.Theorem 2Let G be a (k, k+2)-graph with k≥n3+103. If there exists a nonempty independent subset B_1 of G such that B_1≥n3-133, and B≤n2-1 for all independent subset B of G, then G is Hamiltonian.
出处
《西南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2004年第4期570-572,共3页
Journal of Southwest China Normal University(Natural Science Edition)
