摘要
设ｋ是一不小于３的整数，Ｇ是连通图，具顶点数ｎ≥７ｋ－７，ｋｎ是偶数，且Ｇ的最小度δ（Ｇ）≥ｋ。本文证明了：若对Ｇ中任意一对不相邻的顶点ｕ、ｖ均有２ｎ－１≤ｄ（ｕ）＋ｄ（ｖ）十２｜（ｕ）ＵＮ（Ｖ）Ｄ，则Ｇ有ｋ一因子。
Let k be an integer such that k 3,and let G be a connected graph of order n with n at least 7k-7,kn even,and minimum degree at least k. This article gives a sufficient condition of which G has a k-factor involving the degree sum and the neighborhood union of any two independent venrtices.
出处
《五邑大学学报（自然科学版）》
CAS
1995年第1期34-42,共9页
Journal of Wuyi University(Natural Science Edition)
关键词
度和
邻域并
Degree Sum
Neighborhood Union
