Fault tolerance of hypercube like networks: spanning laceability under edge faults

DOI10.1016/j.tcs.2020.05.049zbMath1461.68040MaRDI QIDQ2192380

Kshirasagar Naik, Min Xu, Krishnaiyan Thulasiraman

Publication date: 17 August 2020

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

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

zbMATH Keywords

fault tolerance; network survivability; hypercube-like network; \(w^\ast\)-connectivity; \(w^\ast\)-laceability

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

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

05C40: Connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spanning connectivity of line graphs
• On the spanning connectivity of graphs
• Identifying codes of cycles with odd orders
• Strong Menger connectivity with conditional faults on the class of hypercube-like networks
• The spanning connectivity of folded hypercubes
• On the spanning connectivity and spanning laceability of hypercube-like networks
• On the spanning fan-connectivity of graphs
• An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
• On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
• Super spanning connectivity on WK-recursive networks
• Hamiltonian properties on the class of hypercube-like networks
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
• On a new class of codes for identifying vertices in graphs
• The Mobius cubes
• The Super Spanning Connectivity of Arrangement Graphs
• Computing and Combinatorics
• Hamiltonian-laceability of star graphs
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
• Disjoint paths in hypercubes with prescribed origins and lengths