The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
DOI10.1016/J.JCSS.2017.11.004zbMATH Open1390.68506OpenAlexW2772067505MaRDI QIDQ1747484FDOQ1747484
Authors: Limei Lin, Sun-Yuan Hsieh, Li Xu, Shuming Zhou, Riqing Chen
Publication date: 8 May 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.11.004
Recommendations
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
- The \(g\)-extra conditional diagnosability of graphs in terms of \(g\)-extra connectivity
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- Conditional diagnosability of arrangement graphs under the PMC model
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- Conditional diagnosability of component-composition graphs under the PMC model
- The extra connectivity and extra diagnosability of regular interconnection networks
- Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Complex networks: structure and dynamics
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- The restricted \(h\)-connectivity of the data center network DCell
- Diagnosability of enhanced hypercubes
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Fault diagnosability of arrangement graphs
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Conditional diagnosability of balanced hypercubes under the PMC model
- Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
- Extraconnectivity of hypercubes
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Reliability Evaluation of BC Networks
- On the conditional diagnosability of matching composition networks
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- On \(g\)-extra connectivity of folded hypercubes
- Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
- On the optimal allocation of virtual resources in cloud computing networks
- Title not available (Why is that?)
- Conditional diagnosability of arrangement graphs under the PMC model
- Conditional diagnosability of hypermesh optical multiprocessor systems under the PMC model
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- The $t/k$-Diagnosability of Star Graph Networks
- Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
- Diagnosability of Two-Matching Composition Networks
- Hypercube-Based Multipath Social Feature Routing in Human Contact Networks
Cited In (25)
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- Relation of extra edge connectivity and component edge connectivity for regular networks
- The non-inclusive diagnosability of regular graphs
- The \(h\)-restricted connectivity of balanced hypercubes
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- The extra connectivity and extra diagnosability of regular interconnection networks
- The Component (Edge) Connectivity of Round Matching Composition Networks
- Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- Reliability analysis of exchanged hypercubes based on the path connectivity
- Title not available (Why is that?)
- \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes
- Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
- The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model
- Characterization of component diagnosability of regular networks
- Relating \(g\)-good-neighbor connectivity and \(g\)-good-neighbor diagnosability of strong digraph network
- Component conditional fault tolerance of hierarchical folded cubic networks
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
- Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault
- Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
- Hybrid fault diagnosis capability analysis of regular graphs
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
- Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model
This page was built for publication: The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747484)