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

DOI10.1016/J.TCS.2020.05.049MaRDI QIDQ2192380zbMATH OpenOpenAlexFDO

Authors Min Xu, Kshirasagar Naik, 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

\(w^\ast\)-connectivity\(w^\ast\)-laceabilityfault tolerancehypercube-like networknetwork survivability

Mathematics Subject Classification ID

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

Recommendations

• The spanning laceability on the faulty bipartite hypercube-like networks
• On the spanning connectivity and spanning laceability of hypercube-like networks
• The super laceability of the hypercubes
• The spanning connectivity of folded hypercubes
• Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes

Cites work

• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• Computing and Combinatorics
• Disjoint paths in hypercubes with prescribed origins and lengths
• Edge-fault-tolerant properties of hypercubes and folded hypercubes
• Graph theory with applications
• Hamiltonian properties on the class of hypercube-like networks
• Hamiltonian-laceability of star graphs
• Identifying codes of cycles with odd orders
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On a new class of codes for identifying vertices in graphs
• On the spanning connectivity and spanning laceability of hypercube-like networks
• On the spanning connectivity of graphs
• On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
• On the spanning fan-connectivity of graphs
• Strong Menger connectivity with conditional faults on the class of hypercube-like networks
• Super spanning connectivity of augmented cubes.
• Super spanning connectivity on WK-recursive networks
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
• The Mobius cubes
• The spanning connectivity of folded hypercubes
• The spanning connectivity of line graphs
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• The super spanning connectivity of arrangement graphs

Cited in

(8)

• Edge fault tolerance analysis of a class of interconnection networks
• The spanning laceability on the faulty bipartite hypercube-like networks
• On the equitable \(k^{*}\)-laceability of hypercubes
• Edge Fault Tolerance on Sparse Networks
• On spanning laceability of bipartite graphs
• The super laceability of the hypercubes
• The spanning connectivity of folded hypercubes
• On the spanning connectivity and spanning laceability of hypercube-like networks

This page was built for publication: Fault tolerance of hypercube like networks: spanning laceability under edge faults

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