On connectivity of consecutive-d digraphs

Authors:
Ding-zhu Du;D. F. Hsu;Hung Q. Ngo;G. W. Peck
Affiliations:
Computer Science and Engineering Department, University of Minnesota, Minneapolis, MN 55455, USA and Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China;Department of Computer and Information Science, Fordham University, Bronx, NY;Computer Science and Engineering Department, University of Minnesota, Minneapolis, MN;Department of 7ffathematics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Discrete Mathematics - Kleitman and combinatorics: a celebration
Year:
2002

Citing 5
Cited 3

Doubly Linked Ring Networks

IEEE Transactions on Computers
Connectivity of Imase and Itoh Digraphs

IEEE Transactions on Computers
The Hamiltonian property of generalized de Bruijn digraphs

Journal of Combinatorial Theory Series B
Connectivity of consecutive-d digraphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing

Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
ICN: Interest-Based Clustering Network

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.