KMS Of Academy of mathematics and systems sciences, CAS
| On quasifactorability in graphs | |
| Cai, MC; Flandrin, E; Li, H | |
| 2001-04-28 | |
| 发表期刊 | DISCRETE MATHEMATICS
 |
| ISSN | 0012-365X |
| 卷号 | 233期号:1-3页码:85-92 |
| 摘要 | Given 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研究方向 | Mathematics |
| WOS类目 | Mathematics |
| WOS记录号 | WOS:000168401100006 |
| 出版者 | ELSEVIER SCIENCE BV |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/16437 |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Cai, MC |
| 作者单位 | 1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Univ Paris 11, CNRS, URA 410, LRI, F-91405 Orsay, France |
| 推荐引用方式 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. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论