On connectivity of consecutive-d digraphs

	On connectivity of consecutive-d digraphs
	Du, DZ ; Hsu, DF ; Ngo, HQ ; Peck, GW
刊名	DISCRETE MATHEMATICS
	2002-11-28
卷号	257 期号:2-3 页码:371-384
关键词	consecutive-d digraphs connectivity interconnection networks
ISSN号	0012-365X
英文摘要	The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper. we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improve several existing results on the connectivity, of de Bruijn digraphs, Kautz digraphs and Imase-Itoh digraphs. (C) 2002 Elsevier Science B.V. All rights reserved.
WOS研究方向	Mathematics
语种	英语
出版者	ELSEVIER SCIENCE BV
WOS记录号	WOS:000178630100013
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/17513]
专题	中国科学院数学与系统科学研究院
通讯作者	Ngo, HQ
作者单位	1.Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA 2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China 3.Fordham Univ, Dept Comp & Informat Sci, Bronx, NY 10458 USA 4.MIT, Dept Math, Cambridge, MA 02139 USA
推荐引用方式 GB/T 7714	Du, DZ,Hsu, DF,Ngo, HQ,et al. On connectivity of consecutive-d digraphs[J]. DISCRETE MATHEMATICS,2002,257(2-3):371-384.
APA	Du, DZ,Hsu, DF,Ngo, HQ,&Peck, GW.(2002).On connectivity of consecutive-d digraphs.DISCRETE MATHEMATICS,257(2-3),371-384.
MLA	Du, DZ,et al."On connectivity of consecutive-d digraphs".DISCRETE MATHEMATICS 257.2-3(2002):371-384.