东南大学学报（英文版）2003，Vol.19Issue(2)：197-199,3.
二分图为k-消去图的2个条件
Two conditions for a bipartite graph to be a k-deleted graph
摘要
Abstract
A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if every edge of G has one endpoint in X and the other in Y.It is proved that a bipartite graph G=(X,Y) with X=Y is a k-deleted graph if and only if kS≤r1+2r2+...+k(rk+...+rΔ)-ε(S) for all SX. Using this result we give a sufficient neighborhood condition for a bipartite to be a k-deleted graph.关键词
二分图/k-因子/k-消去图Key words
bipartite graph/k-factor/k-deleted graph分类
数理科学引用本文复制引用
杨宏晨,薛秀谦..二分图为k-消去图的2个条件[J].东南大学学报（英文版）,2003,19(2):197-199,3.
