Fault-tolerant analysis of a class of networks

Authors:
Jun-Ming Xu;Qiang Zhu;Min Xu
Affiliations:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China;Department of Mathematics, XiDian University, Xi'an, Shanxi 710071, China;School of Mathematical Sciences, Beijing Normal University, Beijing 100875, PR China
Venue:
Information Processing Letters
Year:
2007

Citing 16
Cited 3

On computing a conditional edge-connectivity of a graph

Information Processing Letters
Topological Properties of Hypercubes

IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks

IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing

IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry

Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter

IEEE Transactions on Computers
Extraconnectivity of graphs with large girth

Discrete Mathematics - Special issue on graph theory and applications
On restricted edge-connectivity of graphs

Discrete Mathematics
The Möbius Cubes

IEEE Transactions on Computers
Super-connectivity and super-edge-connectivity for some interconnection networks

Applied Mathematics and Computation
Optimally super-edge-connected transitive graphs

Discrete Mathematics
Note on the connectivity of line graphs

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Super connectivity of line graphs

Information Processing Letters
On optimally-λ(3) transitive graphs

Discrete Applied Mathematics
Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected

Journal of Graph Theory
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Optimal broadcasting for locally twisted cubes

Information Processing Letters
Extraconnectivity of k-ary n-cube networks

Theoretical Computer Science
{2,3}-Extraconnectivities of hypercube-like networks

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G"0,G"1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computation 140 (2003) 245-254]. As applications of the results, we obtain that the 2-extraconnectivities of several well-known interconnection networks, such as hypercubes, twisted cubes, crossed cubes, Mobius cubes and locally twisted cubes, are all equal to 3n-5 when their dimension n is not less than 8. That is, when n=8, at least 3n-5 vertices must be removed to disconnect any one of these n-dimensional networks provided that the removal of these vertices does not isolate a vertex or an edge.