Bipanconnectivity of faulty hypercubes with minimum degree

DOI10.1016/J.AMC.2011.11.041MaRDI QIDQ426602zbMATH OpenOpenAlexFDO

Authors 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

networkshypercubeHamiltonianpanconnectivitypancyclicityfault-tolerantbipanconnectivity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• Edge-fault-tolerant bipanconnectivity of hypercubes
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
• The bipanconnectivity of bipartite hypercube-like networks
• Edge-bipancyclicity of a hypercube with faulty vertices and edges

Cites work

• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 165078 (Why is no real title available?)
• scientific article; zbMATH DE number 3641471 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• A survey of the theory of hypercube graphs
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Edge-pancyclic block-intersection graphs
• Embedding of cycles in arrangement graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Fault-tolerant cycle embedding in the hypercube
• Graph theory with applications
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian paths with prescribed edges in hypercubes
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Longest fault-free paths in hypercubes with vertex faults
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Pancyclic graphs. I
• Pancyclicity of claw-free Hamiltonian graphs
• Pancyclism in Chvátal-Erdős' graphs
• The square of a block is vertex pancyclic
• The super laceability of the hypercubes
• Updating the hamiltonian problem—A survey

Cited in

(10)

• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Edge-fault-tolerant bipanconnectivity of hypercubes
• On the maximal connected component of hypercube with faulty vertices (II)
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The spanning laceability on the faulty bipartite hypercube-like networks
• Panconnectivity for interconnection networks with faulty elements
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Multiple regular graph embeddings into a hypercube with unbounded expansion

This page was built for publication: Bipanconnectivity of faulty hypercubes with minimum degree

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