A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Generalized Measures of Fault Tolerance in n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.92 |
Fault tolerance is especially important for interconnection networks, since the growing size of the networks increases its vulnerability to component failures. A classic measure for the fault tolerance of a network in the case of vertex failures is its connectivity. Given a network based on a graph G and a positive integer h, the R^h-connectivity of G is the minimum cardinality of a set of vertices in G, if any, whose deletion disconnects G, and every remaining component has minimum degree at least h. This paper investigates the R^h-connectivity of the (n,k)-arrangement graph A"n","k for h=1 and h=2, and determines that @k^1(A"n","k)=(2k-1)(n-k)-1 and @k^2(A"n","k)=(3k-2)(n-k)-2, respectively.