Fault-tolerance of \((n, k)\)-star networks
From MaRDI portal
Publication:298504
DOI10.1016/j.amc.2014.10.006zbMath1338.05255OpenAlexW2008268599MaRDI QIDQ298504
Publication date: 20 June 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.006
Related Items
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs ⋮ Parallel routing in regular networks with faults ⋮ On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks ⋮ On fault tolerance of \((n,k)\)-star networks ⋮ Equal relation between \(g\)-good-neighbor diagnosability under the PMC model and \(g\)-good-neighbor diagnosability under the MM\(^\ast\) model of a graph ⋮ Fault diagnosability of data center networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ The fault tolerance of \(( n , k )\)-bubble-sort networks ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault ⋮ A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ On conditional fault tolerance of hierarchical cubic networks ⋮ The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs ⋮ The \(R_g\)-conditional diagnosability of international networks ⋮ Reliability analysis of godan graphs ⋮ Maximum independent sets partition of \((n, k)\)-star graphs ⋮ The restricted \(h\)-connectivity of the data center network DCell
Cites Work
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
- Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges
- On the bounds of feedback numbers of \((n,k)\)-star graphs
- The conditional fault diagnosability of \((n, k)\)-star graphs
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs
- One-to-many node-disjoint paths in \((n,k)\)-star graphs
- Distance formula and shortest paths for the \((n,k)\)-star graphs
- A kind of conditional vertex connectivity of star graphs
- On the surface area of the \((n,k)\)-star graph
- The \((n,k)\)-star graph: A generalized star graph
- A kind of conditional fault tolerance of \((n, k)\)-star graphs
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Conditional connectivity
- A group-theoretic model for symmetric interconnection networks
- Fault Tolerance on Star Graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Generalized measures for fault tolerance of star networks
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS