starlikefactorswithlargecomponents
文献类型：期刊论文
| 作者 | Zhang Yao1; Yan Guiying1 ; Kano Mikio2
|
| 刊名 | journaloftheoperationsresearchsocietyofchina
 |
| 出版日期 | 2015 |
| 卷号 | 3期号:1页码:81 |
| ISSN号 | 2194-668X |
| 英文摘要 | A star-factor of a graph G is a spanning subgraph of G in which every component is a star. Kano and Saito (Discret Math 312: 2005-2008, 2012) showed that a graph G satisfying iso(G-S)≤|S|/m for every S ? V(G) contains a {K_(1,t): m≤t≤2m}-factor, where iso(G-S) denotes the number of isolated vertices in G-S. Then they conjectured that a graph G satisfying iso(G-S)≤|S|/m for every S ? V(G) actually contains a ({K_(1,t): m≤t≤2m -1} ∪ {K_(2m+1)})-factor. In this paper, we show that this conjecture is true. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/37787]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 1.中国科学院数学与系统科学研究院 2.茨城大学 |
| 推荐引用方式 GB/T 7714 | Zhang Yao,Yan Guiying,Kano Mikio. starlikefactorswithlargecomponents[J]. journaloftheoperationsresearchsocietyofchina,2015,3(1):81. |
| APA | Zhang Yao,Yan Guiying,&Kano Mikio.(2015).starlikefactorswithlargecomponents.journaloftheoperationsresearchsocietyofchina,3(1),81. |
| MLA | Zhang Yao,et al."starlikefactorswithlargecomponents".journaloftheoperationsresearchsocietyofchina 3.1(2015):81. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。