纺织高校基础科学学报2002，Vol.15Issue(2)：135-138,4.
图有[a,b]因子的度条件
A degree condition for graphs to have [a,b]-factors
李建湘1
作者信息
- 1. 湘潭工学院,数理系,湖南,湘潭,411201
- 折叠
摘要
Abstract
A graph is called K1,n-free if it contains no K1,n as an induced subgraph.Let G be a graph with vertex set V(G).Let n(≥3), a and b be integers such that b≥a≥1,and if b is odd,b≥n-1.We prove that every K1,n-free connected graph G with b|V(G)| even has an [a,b]-factor if its minimum degree is at least a+n-1,|V(G)|≥{(a+b)(a+b-1)+1}/b,andmax{dG(x),dG(y)}≥a|V(G)|/(a+b),for any two non-adjacent vertices x and y of V(G).关键词
图/[a,b]-因子/度Key words
graph/[a,b]-factor/degree分类
数理科学引用本文复制引用
李建湘..图有[a,b]因子的度条件[J].纺织高校基础科学学报,2002,15(2):135-138,4.
