Bipanconnectivity of faulty hypercubes with minimum degree

DOI10.1016/j.amc.2011.11.041zbMath1242.05194MaRDI QIDQ426602

Chao-Ming Sun

Publication date: 11 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.11.041

zbMATH Keywords

hypercube; Hamiltonian; networks; pancyclicity; panconnectivity; fault-tolerant; bipanconnectivity

Mathematics Subject Classification ID

05C65: Hypergraphs

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Related Items

Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions, Fault-tolerant cycles embedding in hypercubes with faulty edges, Multiple regular graph embeddings into a hypercube with unbounded expansion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Pancyclism in Chvátal-Erdős' graphs
• Longest fault-free paths in hypercubes with vertex faults
• The super laceability of the hypercubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• A survey of the theory of hypercube graphs
• Edge-pancyclic block-intersection graphs
• The square of a block is vertex pancyclic
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Pancyclicity of claw-free Hamiltonian graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Pancyclic graphs. I
• Updating the hamiltonian problem—A survey
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Embedding of cycles in arrangement graphs