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
The (n,k)-star graph: a generalized star graph
Information Processing Letters
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
Ring Embedding in Faulty (n, k)-star Graphs
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
Conditional connectivity of Cayley graphs generated by transposition trees
Information Processing Letters
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
| Hi-index | 0.89 |
A vertex subset F is a R"k-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 R"k-vertex-cut of G is the R"k-connectivity of G, denoted by @k^k(G). This parameter measures a kind of conditional fault tolerance of networks. This parameter measures a kind of conditional fault tolerance of networks. In this paper, we determine R"1-connectivity and R"2-connectivity of (n,k)-star graphs.