On the maximal connected component with faulty vertices on the class of hypercube-like networks

DOI10.3969/J.ISSN.1001-8395.2019.04.005zbMATH Open1449.05231MaRDI QIDQ5209936FDOQ5209936

Authors Dengxin Zhai, Mamut Aygul

Publication date 22 January 2020

zbMATH Keywords

fault tolerancehypercube-like networksmaximal connected component

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• On the maximal connected component of hypercube with faulty vertices
• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of a hypercube with faulty vertices III
• Strong Menger connectivity with conditional faults on the class of hypercube-like networks
• Edge-disjoint paths in faulty hypercube-like networks.

Cited in

(7)

• On the maximal connected component of hypercube with faulty vertices
• On the maximal connected component of hypercube with faulty vertices (II)
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The spanning laceability on the faulty bipartite hypercube-like networks
• Strong Menger connectivity with conditional faults on the class of hypercube-like networks
• On the maximal connected component of a hypercube with faulty vertices III
• Linearly many faults in dual-cube-like networks

This page was built for publication: On the maximal connected component with faulty vertices on the class of hypercube-like networks

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