On the maximal connected component of hypercube with faulty vertices

DOI10.1080/00207160410001661726zbMATH Open1090.68007OpenAlexW4254221886MaRDI QIDQ4831409FDOQ4831409

Hong-Jian Lai, Xiaofan Yang, Graham M. Megson, D. J. Evans, Bill Chen

Publication date: 29 December 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160410001661726

Recommendations

• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of a hypercube with faulty vertices III
• On the maximal connected component with faulty vertices on the class of hypercube-like networks
• Longest fault-free paths in hypercubes with vertex faults
• The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity

zbMATH Keywords

HypercubeFault ToleranceInterconnection NetworkMaximal Connected Component

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Fault Diagnosis in a Boolean n Cube Array of Microprocessors

Cited In (37)

• Largest connected component of a star graph with faulty vertices
• The conditional fault diagnosability of \((n, k)\)-star graphs
• Fault tolerance and diagnosability of burnt pancake networks under the comparison model
• Note on the subgraph component polynomial
• Fault diagnosability of arrangement graphs
• Conditional diagnosability of alternating group networks
• Fault diagnosability of DQcube under the PMC model
• On the maximal connected component of hypercube with faulty vertices (II)
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
• Vulnerability analysis of multiprocessor system based on burnt pancake networks
• The largest component of faulty star graphs
• Minimum neighborhood in a generalized cube
• Maximally local connectivity and connected components of augmented cubes
• Structural diagnosability of hypercubes under the PMC and MM* models
• Star fault tolerance of hypercube
• On the conditional diagnosability of matching composition networks
• On extra connectivity and extra edge-connectivity of balanced hypercubes
• Fault-tolerant maximal local-connectivity on bubble-sort star graphs
• Structural properties of \(m\)-ary \(n\)-dimensional hypercubes
• On the 3-Extra Connectivity of Enhanced Hypercubes
• Linearly many faults in arrangement graphs
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• Structural Properties of Generalized Exchanged Hypercubes
• Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
• The 2-path-bipanconnectivity of hypercubes
• On the \(g\)-extra diagnosability of enhanced hypercubes
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
• Reliability evaluation of DQcube based on \(g\)-good neighbor and \(g\)-component fault pattern
• Component connectivity of the hypercubes
• Linearly many faults in \((n,k)\)-star graphs
• A strong connectivity property of the generalized exchanged hypercube
• Linearly many faults in 2-tree-generated networks
• A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
• On the maximal connected component of a hypercube with faulty vertices III
• Conditional fault diagnosis of hierarchical hypercubes
• A (4n − 9)/3 diagnosis algorithm for generalised cube networks

This page was built for publication: On the maximal connected component of hypercube with faulty vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831409)