CSpace
Solution to a problem on degree sequences of graphs
Cai, MC; Deng, XT; Zang, WN
2000-05-28
发表期刊DISCRETE MATHEMATICS
ISSN0012-365X
卷号219期号:1-3页码:253-257
摘要Let a(1), a(2),..., a(n) and b(1), b(2),..., b(n) be integers with 0 less than or equal to a(i) less than or equal to b(i) for i = 1,2,..., n. The purpose of this note is to give a good characterization for the existence of a simple graph G with vertices v(1), v(2),..., v(n) such that a(i) less than or equal to d(G)(v(i)) less than or equal to b(i) for i = 1, 2,..., n. This solves a research problem posed by Niessen and generalizes an Erdos-Gallai theorem. (C) 2000 Elsevier Science B.V. All rights reserved.
语种英语
WOS研究方向Mathematics
WOS类目Mathematics
WOS记录号WOS:000087401000022
出版者ELSEVIER SCIENCE BV
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/15821
专题中国科学院数学与系统科学研究院
通讯作者Zang, WN
作者单位1.Univ Hong Kong, Dept Math, Hong Kong, Peoples R China
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
3.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
推荐引用方式
GB/T 7714
Cai, MC,Deng, XT,Zang, WN. Solution to a problem on degree sequences of graphs[J]. DISCRETE MATHEMATICS,2000,219(1-3):253-257.
APA Cai, MC,Deng, XT,&Zang, WN.(2000).Solution to a problem on degree sequences of graphs.DISCRETE MATHEMATICS,219(1-3),253-257.
MLA Cai, MC,et al."Solution to a problem on degree sequences of graphs".DISCRETE MATHEMATICS 219.1-3(2000):253-257.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Cai, MC]的文章
[Deng, XT]的文章
[Zang, WN]的文章
百度学术
百度学术中相似的文章
[Cai, MC]的文章
[Deng, XT]的文章
[Zang, WN]的文章
必应学术
必应学术中相似的文章
[Cai, MC]的文章
[Deng, XT]的文章
[Zang, WN]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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