Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

DOI10.1016/j.ipl.2010.09.012zbMath1379.68253OpenAlexW2027633419MaRDI QIDQ1675872

Xie-Bin Chen

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.012

zbMATH Keywords

hypercubefault toleranceinterconnection networkspath embeddingbipanconnectivityfault-tolerant diameter

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

The vulnerability of the diameter of the enhanced hypercubes, A note on cycle embedding in hypercubes with faulty vertices, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, The 2-path-bipanconnectivity of hypercubes, Hamiltonicity of hypercubes with faulty vertices, Panconnectivity and edge-pancyclicity of multidimensional torus networks, A Hypercube Variant with Small Diameter, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Topological properties on the diameters of the integer simplex

Cites Work

• Unnamed Item
• Unnamed Item
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• Many-to-many disjoint paths in faulty hypercubes
• Longest fault-free paths in hypercubes with vertex faults
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Path partitions of hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Path embedding in faulty hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Long paths in hypercubes with conditional node-faults
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Survey on path and cycle embedding in some networks
• A survey of the theory of hypercube graphs
• Spanning multi-paths in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices