On the maximal connected component of hypercube with faulty vertices

DOI10.1080/00207160410001661726MaRDI QIDQ4831409zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

Fault ToleranceHypercubeInterconnection NetworkMaximal Connected Component

Mathematics Subject Classification ID

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

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

Cites work

• Fault Diagnosis in a Boolean n Cube Array of Microprocessors

Cited in

(40)

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

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)