CSpace  > 应用数学研究所
starlikefactorswithlargecomponents
Zhang Yao1; Yan Guiying1; Kano Mikio2
2015
Source Publicationjournaloftheoperationsresearchsocietyofchina
ISSN2194-668X
Volume3Issue:1Pages:81
AbstractA 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.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/37788
Collection应用数学研究所
Affiliation1.中国科学院数学与系统科学研究院
2.茨城大学
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang Yao]'s Articles
[Yan Guiying]'s Articles
[Kano Mikio]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang Yao]'s Articles
[Yan Guiying]'s Articles
[Kano Mikio]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang Yao]'s Articles
[Yan Guiying]'s Articles
[Kano Mikio]'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.