On computing a conditional edge-connectivity of a graph
Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
On restricted edge-connectivity of graphs
Discrete Mathematics
Fault hamiltonicity of augmented cubes
Parallel Computing
Super connectivity of line graphs
Information Processing Letters
The super connectivity of shuffle-cubes
Information Processing Letters
On reliability of the folded hypercubes
Information Sciences: an International Journal
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
A note on “The super connectivity of augmented cubes”
Information Processing Letters
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
The super connectivity of exchanged hypercubes
Information Processing Letters
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Conditional edge-fault pancyclicity of augmented cubes
Theoretical Computer Science
| Hi-index | 0.89 |
The augmented cube AQ"n, proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a (2n-1)-regular (2n-1)-connected graph (n3). This paper determines that the super connectivity of AQ"n is 4n-8 for n=6 and the super edge-connectivity is 4n-4 for n=5. That is, for n=6 (respectively, n=5), at least 4n-8 vertices (respectively, 4n-4 edges) of AQ"n are removed to get a disconnected graph that contains no isolated vertices. When the augmented cube is used to model the topological structure of a large-scale parallel processing system, these results can provide more accurate measurements for reliability and fault tolerance of the system.