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

• 作者: Changhua Huang Man Liu Qingzhi Yu Shuling Wang
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: CLAW Free GRAPHS (1 2n – 1)-Odd Factor Factor-Criticality
• 年，卷（期）: 2012,（12）
• 页码范围: 1874-1876
• 页数: 3页
• 分类号: O1

摘要

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.