Cheng, S.Y. and Chuang, J.H. (1994) Varietal Hypercube—A New Interconnection Network Topology for Large Scale Multicomputer. Proceedings of 1994 International Conference on Parallel and Distributed Systems, Hsinchu, 19-21 December 1994, 703-708.

has been cited by the following article:

• TITLE: Reliability Analysis of Varietal Hypercube

  AUTHORS: Guiyu Shi, Ganghua Xie, Yinkui Li

  KEYWORDS: Interconnection Networks, Fault Tolerance, g-Component Connectivity

  JOURNAL NAME: Applied Mathematics, Vol.15 No.4, April 15, 2024

  ABSTRACT: Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.