Huang and Wu in IEEE Transactions on Computers 46 (1997) 484-490 introduced the
balanced hypercube BH_n as an interconnection network topology for computing systems …

The balanced hypercube BH n, as a new variation of the hypercube, possesses many
attractive properties such that the hypercube dose not have. Given a connected graph G and …

The reliability of an interconnection network is an important issue for multiprocessor
systems. In this paper, we study a reliability measure, called super connectivity, in the …

The exchanged hypercube EH (s, t) where s⩾ 1 and t⩾ 1 are two positive integers, proposed
by Loh et al.[The exchanged hypercube, IEEE Transactions on Parallel and Distributed …

We define a new class of graphs by generalizing the hypercube-like networks to folded
hypercube-like networks FH n. We also investigate the reliability of this class of graphs in …

The n-dimensional folded crossed cube FCQ n is obtained from the crossed cube CQ n by
adding extra 2 n− 1 edges. The super connectivity (resp. super edge-connectivity) of a …

The connectivity of a graph is the minimum number of nodes, whose removal will cause the
graph disconnected. It is one of the basic and important properties of the graph, and can be …

Augmented k-ary n-cube AQ n, k is proposed as a new interconnection network model by
Xiang and Steward [Augmented k-ary n-cubes, Inform. Sci. 181 (1)(2011), pp. 239–256]. For …

Abstract Let G=(V, E) G=(V, E) be a connected graph. The conditional edge connectivity λ _
δ^ k (G) λ δ k (G) is the cardinality of the minimum edge cuts, if any, whose deletion …

A vertex-cut S is called a super vertex-cut if G− S is disconnected and it contains no isolated
vertices. The super-connectivity, κ′, is the minimum cardinality over all super vertex-cuts …