Some Results on (1,2<i>n</i>– 1)-Odd Factors  

作　　者：Man Liu Qingzhi Yu Shuling Wang Changhua Huang 

机构地区：[1]Aerial Four Station Department, Air Force Logistics College, Xuzhou, China [2]Department of Basic Course, Air Force Logistics College, Xuzhou, China

出　　处：《Applied Mathematics》2012年第12期1874-1876,共3页应用数学（英文）

摘　　要：Let G be a graph. If there exists a spanning subgraph F such that dF(x) ∈ {1,3,…2n – 1}, then is called to be (1,2n – 1)-odd factor of G. Some sufficient and necessary conditions are given for G – U to have (1,2n – 1)-odd factor where U is any subset of V(G) such that |U| = k.Let G be a graph. If there exists a spanning subgraph F such that dF(x) ∈ {1,3,…2n – 1}, then is called to be (1,2n – 1)-odd factor of G. Some sufficient and necessary conditions are given for G – U to have (1,2n – 1)-odd factor where U is any subset of V(G) such that |U| = k.

关 键 词：CLAW Free GRAPHS (1 2n – 1)-Odd Factor Factor-Criticality 

分 类 号：O1[理学—数学]