CSpace
Super line-connectivity of consecutive-d digraphs
Cao, F; Du, DZ; Hsu, DF; Hwang, LH; Wu, WL
1998-03-15
发表期刊DISCRETE MATHEMATICS
ISSN0012-365X
卷号183期号:1-3页码:27-38
摘要The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of many digraphs, such as de Bruijn digraphs, Kautz digraphs, and Imase-Itoh digraphs, which contain many hamiltonian digraphs with near-minimum diameter and near-maximum connectivity. In this paper, we show sufficient conditions for modified consecutive-d digraphs to have super line-connectivity.
语种英语
WOS研究方向Mathematics
WOS类目Mathematics
WOS记录号WOS:000072010300003
出版者ELSEVIER SCIENCE BV
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/13917
专题中国科学院数学与系统科学研究院
作者单位1.Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA
2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China
3.Fordham Univ, Dept Informat & Comp Sci, Bronx, NY 10458 USA
推荐引用方式
GB/T 7714
Cao, F,Du, DZ,Hsu, DF,et al. Super line-connectivity of consecutive-d digraphs[J]. DISCRETE MATHEMATICS,1998,183(1-3):27-38.
APA Cao, F,Du, DZ,Hsu, DF,Hwang, LH,&Wu, WL.(1998).Super line-connectivity of consecutive-d digraphs.DISCRETE MATHEMATICS,183(1-3),27-38.
MLA Cao, F,et al."Super line-connectivity of consecutive-d digraphs".DISCRETE MATHEMATICS 183.1-3(1998):27-38.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Cao, F]的文章
[Du, DZ]的文章
[Hsu, DF]的文章
百度学术
百度学术中相似的文章
[Cao, F]的文章
[Du, DZ]的文章
[Hsu, DF]的文章
必应学术
必应学术中相似的文章
[Cao, F]的文章
[Du, DZ]的文章
[Hsu, DF]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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