Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Extraconnectivity of graphs with large girth
Discrete Mathematics - Special issue on graph theory and applications
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance in n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Graph Theory With Applications
Graph Theory With Applications
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Linearly many faults in dual-cube-like networks
Theoretical Computer Science
| Hi-index | 0.89 |
A vertex subset F is a k-restricted vertex-cut of a connected graph G if G-F is disconnected and every vertex in G-F has at least k good neighbors in G-F. The cardinality of the minimum k-restricted vertex-cut of G is the k-restricted connectivity of G, denoted by @k^k(G). This parameter measures a kind of conditional fault tolerance of networks. In this paper, we show that for the n-dimensional alternating group graph AG"n, @k^2(AG"4)=4 and @k^2(AG"n)=6n-18 for n=5.