Let G be a graph, and let a, b, k be integers with 0 <= a <= b, k >= 0. Then graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this paper, the relationship between binding number bind(G) and (a, b, k)critical graph is discussed, and a binding number condition for a graph to be (a, b, k)-critical is given.
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Zhou, Sizhong
Duan, Ziming
论文数: 0引用数: 0
h-index: 0
机构:
China Univ Min & Technol, Sch Sci, Xuzhou 221008, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Zhou, Sizhong
Xu, Zurun
论文数: 0引用数: 0
h-index: 0
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Xu, Zurun
Zong, Minggang
论文数: 0引用数: 0
h-index: 0
机构:
Jiangsu Univ, Fac Sci, Zhenjiang 212013, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Zhou, Sizhong
Bian, Qiuxiang
论文数: 0引用数: 0
h-index: 0
机构:
Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
Bian, Qiuxiang
Sun, Zhiren
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Normal Univ, Sch Math Sci, Nanjing 210046, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China