Path and cycle fault tolerance of bubble-sort graph networks

DOI10.1016/j.tcs.2019.01.036zbMath1422.68200OpenAlexW2912246636WikidataQ128446059 ScholiaQ128446059MaRDI QIDQ2420577

Guozhen Zhang, Shang-Wei Lin

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.036

zbMATH Keywords

pathscyclesfault tolerancestructure connectivitysubstructure connectivitybubble-sort graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

The (strong) structure connectivity and (strong) substructure connectivity of the \(( n , k )\)-bubble-sort network, Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern, Subnetwork reliability analysis of bubble-sort graph networks, Structure fault-tolerance of arrangement graphs, Hyper \(K_{1, r}\) and sub-\(K_{1, r}\) fault tolerance of star graphs, Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks, Structure fault-tolerance of divide-and-swap \(k\)-ary \(n\)-cube, Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern, Hyper star fault tolerance of bubble sort networks, Structure fault tolerance of balanced hypercubes, Extra (component) connectivity and diagnosability of bubble sort networks, Structure connectivity and substructure connectivity of wheel networks, The structure fault tolerance of arrangement graphs, Structure connectivity and substructure connectivity of bubble-sort star graph networks, Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks

Cites Work

• Unnamed Item
• Structure connectivity and substructure connectivity of hypercubes
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
• The number of shortest paths in the arrangement graph
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Conditional matching preclusion for the arrangement graphs
• Fault tolerance in \(k\)-ary \(n\)-cube networks
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
• A study of fault tolerance in star graph
• Optimal fault-tolerant embedding of paths in twisted cubes
• Hamiltonian laceability of bubble-sort graphs with edge faults
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes
• Extraconnectivity of hypercubes
• Conditional connectivity of Cayley graphs generated by transposition trees
• Structure fault tolerance of hypercubes and folded hypercubes
• On the extraconnectivity of graphs
• Structure connectivity and substructure connectivity of twisted hypercubes
• 3-extra connectivity of 3-ary \(n\)-cube networks
• A group-theoretic model for symmetric interconnection networks
• Lee distance and topological properties of k-ary n-cubes