Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Connectivity of Kautz networks
Discrete Mathematics - Special issue on combinatorics and algorithms
Combinatorial properties of generalized hypercube graphs
Information Processing Letters
Highly fault-tolerant routings and fault-induced diameter for generalized hypercube graphs
Journal of Parallel and Distributed Computing
Disjoint paths of bounded length in large generalized cycles
Discrete Mathematics
Hi-index | 0.09 |
Hypercube and Kautz network each possess certain desirable properties. However, some of the attractive features of one network are not found in the other. A novel class of network topologies proposed in this paper has the generalized hypercube and the Kautz network as its two extremes. The proposed network inherits the topological properties of both the Kautz network and the generalized hypercube to a varying degree. This allows us to trade-off cost and performance effectively and construct networks which are most suitable for a particular purpose. In the present paper, we investigate the connectivity, wide-diameter, fault-tolerance, Hamiltonicity.