CSpace
A characterization of the graphs with high degree sum that are not covered by three cycles
Chiba, Shuya1; Tsugaki, Masao2
2016-07-01
发表期刊ARS COMBINATORIA
ISSN0381-7032
卷号128页码:127-163
摘要Let G be a graph of order n. In [A. Saito, Degree sums and graphs that are not covered by two cycles, J. Graph Theory 32 (1999), 51-61.], Saito characterized the graphs with sigma(3)(G) >= n - 1 that are not covered by two cycles. In this paper, we characterize the graphs with sigma(4) (G) >= n - 1 that are not covered by three cycles. Moreover, to prove our main theorem, we show several new results which are useful in the study of this area.
关键词Degree sum Cycle cover
语种英语
资助项目JSPS[23740087] ; Chinese Academy of Science[2012Y1JA0004]
WOS研究方向Mathematics
WOS类目Mathematics
WOS记录号WOS:000380622200010
出版者CHARLES BABBAGE RES CTR
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/23318
专题中国科学院数学与系统科学研究院
通讯作者Chiba, Shuya
作者单位1.Kumamoto Univ, Dept Math & Engn, 2-39-1 Kurokami, Kumamoto 8608555, Japan
2.Chinese Acad Sci, Inst Math & Syst Sci, Beijing, Peoples R China
推荐引用方式
GB/T 7714
Chiba, Shuya,Tsugaki, Masao. A characterization of the graphs with high degree sum that are not covered by three cycles[J]. ARS COMBINATORIA,2016,128:127-163.
APA Chiba, Shuya,&Tsugaki, Masao.(2016).A characterization of the graphs with high degree sum that are not covered by three cycles.ARS COMBINATORIA,128,127-163.
MLA Chiba, Shuya,et al."A characterization of the graphs with high degree sum that are not covered by three cycles".ARS COMBINATORIA 128(2016):127-163.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chiba, Shuya]的文章
[Tsugaki, Masao]的文章
百度学术
百度学术中相似的文章
[Chiba, Shuya]的文章
[Tsugaki, Masao]的文章
必应学术
必应学术中相似的文章
[Chiba, Shuya]的文章
[Tsugaki, Masao]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。