Fault diagnosability of arrangement graphs
From MaRDI portal
Publication:497286
DOI10.1016/j.ins.2013.04.038zbMath1337.68215arXiv1204.4018OpenAlexW2115228197MaRDI QIDQ497286
Publication date: 23 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4018
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs ⋮ The \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* model ⋮ Parallel routing in regular networks with faults ⋮ Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model ⋮ Conditional diagnosability of the round matching composition networks ⋮ Structure fault-tolerance of arrangement graphs ⋮ Fault diagnosability of data center networks ⋮ Conditional diagnosability of arrangement graphs under the PMC model ⋮ The symmetry property of (n,k)‐arrangement graph ⋮ The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions ⋮ The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model ⋮ Researches for more reliable arrangement graphs in multiprocessor computer system ⋮ Note on reliability evaluation of arrangement graphs ⋮ Fault tolerance and diagnosability of burnt pancake networks under the comparison model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional diagnosability of alternating group networks
- Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
- Arrangement graphs: A class of generalized star graphs
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- On conditional diagnosability of the folded hypercubes
- On the arrangement graph.
- Linearly many faults in 2-tree-generated networks
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- On the maximal connected component of a hypercube with faulty vertices III
- Generalized matching networks and their properties
- Largest connected component of a star graph with faulty vertices
- A group-theoretic model for symmetric interconnection networks
- On Fault Identification in Diagnosable Systems
- Fault-Tolerant Broadcasting on the Arrangement Graph
- On the maximal connected component of hypercube with faulty vertices (II)
- Increasing the connectivity of the star graphs
- On the maximal connected component of hypercube with faulty vertices
- Embedding of cycles in arrangement graphs
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
