Conditional connectivity for (n,k)-arrangement graphs

zbMATH Open1289.05248MaRDI QIDQ2858737FDOQ2858737

Authors: Limei Lin, Shuming Zhou 

Publication date: 19 November 2013

Published in: Journal of Mathematical Study (Search for Journal in Brave)

Recommendations

• Conditional fault tolerance of arrangement graphs
• Fault tolerance in the arrangement graphs
• The structure fault tolerance of arrangement graphs
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• Linearly many faults in arrangement graphs

zbMATH Keywords

conditional connectivityfault tolerance\((n, k)\)-arrangement graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cited In (4)

• On conditional fault tolerance of hierarchical cubic networks
• The restricted \(h\)-connectivity of the data center network DCell
• The extra connectivity of bubble-sort star graphs
• Note on reliability evaluation of arrangement graphs

This page was built for publication: Conditional connectivity for \((n,k)\)-arrangement graphs

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