摘要
设G是一个简单无向图,G的联结数定义为bind(G)=min|NG(X)||X|:Ф≠X V(G),NG(X)≠V(G)研究了图的联结数bind(G)与图的分数[a,b]-因子之间的关系,给出了图有分数[a,b]-因子的若干充分条件.
Let G be a graph, the binding number of G is defined as bind(G)=min{|NG(X)|/|X|:φ≠X≤V(G),NG(X)≠V(G)}The relationship of binding numbers bind(G) to factional [a,b]-faetors of graphs was discussed,and some sufficient conditions of existence of fractional [a,b]-factors with the graphs were given.
出处
《兰州理工大学学报》
CAS
北大核心
2006年第1期146-147,共2页
Journal of Lanzhou University of Technology
基金
国家自然科学基金(10171013)
关键词
图
联结数
分数[a
b]-因子
graph
binding number
fractional [a,b]-factor