摘要
研究了图有分数因子的联结数和最小度条件.给出了一个图有分数1-因子的与联结数有关的充分必要条件。当k≥2时,给出了一个图有分数k-因子的两个充分条件,并证明了所得结果是最好可能的.
Binding number and minimum degree conditions for a graph to have fractional factors are studied. Firstly, a necessary and sufficient condition on binding number for a graph to have a fractional 1-factor is given. Secondly, two sufficient conditions for a graph to have a fractional A-factor with k≥2 are obtained and it is shown that the results are best possible.
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2004年第3期1-5,共5页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(60172003)
山东省自然科学基金资助项目(Z2000A02)
关键词
图
联结数
分数1-因子
分数k-因子
graph
binding number
fractional 1-factor
fractional k-factor
