On connectivity of consecutive-d digraphs
Du, DZ; Hsu, DF; Ngo, HQ; Peck, GW
AbstractThe 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.
Keywordconsecutive-d digraphs connectivity interconnection networks
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000178630100013
Citation statistics
Document Type期刊论文
Corresponding AuthorNgo, HQ
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Du, DZ]'s Articles
[Hsu, DF]'s Articles
[Ngo, HQ]'s Articles
Baidu academic
Similar articles in Baidu academic
[Du, DZ]'s Articles
[Hsu, DF]'s Articles
[Ngo, HQ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Du, DZ]'s Articles
[Hsu, DF]'s Articles
[Ngo, HQ]'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.