Linearly many faults in arrangement graphs

DOI10.1002/net.21476zbMath1269.68028OpenAlexW2013417739MaRDI QIDQ5326794

Eddie Cheng, Allen Yuan, László Lipták

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21476

zbMATH Keywords

connectivityfault tolerancearrangement graphs

Mathematics Subject Classification ID

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

Related Items (9)

On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ The symmetry property of (n,k)‐arrangement graph ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks ⋮ On the eigenvalues of certain Cayley graphs and arrangement graphs ⋮ Cayley graph on symmetric group generated by elements fixing \(k\) points ⋮ Note on reliability evaluation of arrangement graphs ⋮ On the extraconnectivity of arrangement graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Arrangement graphs: A class of generalized star graphs
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Cuts leaving components of given minimum order
• Restricted connectivity for three families of interconnection networks
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• On the arrangement graph.
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• Linearly many faults in 2-tree-generated networks
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• On the maximal connected component of a hypercube with faulty vertices III
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• On the maximal connected component of hypercube with faulty vertices (II)
• Increasing the connectivity of the star graphs
• On the maximal connected component of hypercube with faulty vertices
• A new class of interconnection networks based on the alternating group
• Connectivity of transitive graphs
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Linearly many faults in arrangement graphs