scientific article; zbMATH DE number 2187684
From MaRDI portal
Publication:5460881
zbMath1066.68003MaRDI QIDQ5460881
Marc J. Lipman, Eddie Cheng, Hyungju Park
Publication date: 20 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (25)
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ Cluster connectivity of hypercube-based networks under the super fault-tolerance condition ⋮ Restricted connectivity and good-neighbor diagnosability of split-star networks ⋮ Matroidal connectivity and conditional matroidal connectivity of star graphs ⋮ Structure connectivity and substructure connectivity of split-star networks ⋮ Super-connectivity and super-edge-connectivity for some interconnection networks ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Super spanning connectivity of split-star networks ⋮ Conditional diagnosability and strong diagnosability of split-star networks under the PMC model ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Fault diagnosability of arrangement graphs ⋮ The pessimistic diagnosability of split-star networks under the PMC model ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ An optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ Super edge-connectivity of mixed Cayley graph ⋮ Hamiltonian connectivity of 2-tree-generated networks ⋮ Unnamed Item ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Combinatorial analysis of the subsystem reliability of the split-star network ⋮ The diagnosability of wheel networks with the condition: 2-extra ⋮ Survey on path and cycle embedding in some networks ⋮ Fault tolerance and diagnosability of burnt pancake networks under the comparison model ⋮ Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness ⋮ Realizability of fault-tolerant graphs
This page was built for publication:
