| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709724 | Applied Mathematics Letters | 2010 | 5 Pages |
Abstract
In this paper we obtain sufficient conditions using isolated vertices for component factors with each component of order at least three. In particular, we show that if a graph GG satisfies iso(G−S)≤|S|/2 for all S⊂V(G)S⊂V(G), then GG has a {K1,2,K1,3,K5}{K1,2,K1,3,K5}-factor, where iso(G−S) denotes the number of isolated vertices in G−SG−S.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
M. Kano, Hongliang Lu, Qinglin Yu,