On quasifactorability in graphs
Cai, MC; Flandrin, E; Li, H
AbstractGiven a graph G and two functions f and g: V(G) --> Z(+) with f(v)greater than or equal to g(v) for each v is an element of V(G), a (g, f)-quasifactor in G is a subgraph e of G such that for each Vertex v in V(Q), g(v)less than or equal tod(Q)(v)less than or equal to f(v); in the particular case when For Allv is an element of V(Q), f(v) = g(v) = k is an element of N, we say that Q is a k-quasifactor. A subset S of Vertices of G is said (g,f)-quasifactorable in G if there exists some (g, f)-quasifactor that contains all the vertices of S. In this paper, we give several results on the 2-quasifactorability of a vertex subset which are related to minimum degree, degree sum, independence number and neighborhood union conditions. (C) 2001 Elsevier Science B.V. All rights reserved.
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000168401100006
Citation statistics
Document Type期刊论文
Corresponding AuthorCai, MC
Affiliation1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
2.Univ Paris 11, CNRS, URA 410, LRI, F-91405 Orsay, France
Recommended Citation
GB/T 7714
Cai, MC,Flandrin, E,Li, H. On quasifactorability in graphs[J]. DISCRETE MATHEMATICS,2001,233(1-3):85-92.
APA Cai, MC,Flandrin, E,&Li, H.(2001).On quasifactorability in graphs.DISCRETE MATHEMATICS,233(1-3),85-92.
MLA Cai, MC,et al."On quasifactorability in graphs".DISCRETE MATHEMATICS 233.1-3(2001):85-92.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Cai, MC]'s Articles
[Flandrin, E]'s Articles
[Li, H]'s Articles
Baidu academic
Similar articles in Baidu academic
[Cai, MC]'s Articles
[Flandrin, E]'s Articles
[Li, H]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Cai, MC]'s Articles
[Flandrin, E]'s Articles
[Li, H]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.