A Neighborhood Condition for Graphs to Have Special [a,b]-Factor - Applied Mathematics

AM > Vol.5 No.1, January 2014

A Neighborhood Condition for Graphs to Have Special [a,b]-Factor ()

HTML

Download as PDF (Size: 104KB) PP. 212-215

DOI: 10.4236/am.2014.51022 4,851 Downloads 6,369 Views Citations

Author(s)

Jinguo Lei, Qingzhi Yu, Changhua Huang, Man Liu

Affiliation(s)

Department of Aerial Ammunition, Air Force Logistic College, Xuzhou, China.
Department of Aerial Four Station Support, Xuzhou Air Force Logistic College, Xuzhou, China.
Department of Fundamental Courses, Air Force Logistic College, Xuzhou, China.

ABSTRACT

Let G be a graph of order n, and let a and b be integers, such that 1 ≤ a < b. Let H be a subgraph of G with m(≤b) edges, and δ(G) be the minimum degree. We prove that G has a [a,b]-factor containing all edges of H if , , and when a ≤ 2, .

KEYWORDS

Graph; Factor; [a, b]-Factor; The Minimum Degree; Neighborhood Condition

Share and Cite:

J. Lei, Q. Yu, C. Huang and M. Liu, "A Neighborhood Condition for Graphs to Have Special [a,b]-Factor," Applied Mathematics, Vol. 5 No. 1, 2014, pp. 212-215. doi: 10.4236/am.2014.51022.

Journals Menu