The 2-path-bipanconnectivity of hypercubes

DOI10.1016/j.ins.2013.03.037zbMath1337.68200OpenAlexW2008242913MaRDI QIDQ497128

Xie-Bin Chen

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.03.037

zbMATH Keywords

hypercubeHamiltonian pathinterconnection networkpanconnectivity\( k\)-disjoint path cover\(k\)-path-panconnectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks

Cites Work

• Unnamed Item
• Unnamed Item
• Long paths in hypercubes with a quadratic number of faults
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Longest fault-free paths in hypercubes with vertex faults
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• The two-equal-disjoint path cover problem of matching composition network
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Path partitions of hypercubes
• On path bipancyclicity of hypercubes
• Path embedding in faulty hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• The panpositionable panconnectedness of augmented cubes
• On the bipanpositionable bipanconnectedness of hypercubes
• Edge-fault-tolerant bipanconnectivity of hypercubes
• The bipancycle-connectivity of the hypercube
• 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
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• Fault-tolerant Hamiltonian laceability of hypercubes.
• A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
• Spanning multi-paths in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of conditional faulty hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• On the maximal connected component of a hypercube with faulty vertices III
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of hypercube with faulty vertices
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: The 2-path-bipanconnectivity of hypercubes