Some results on topological properties of folded hypercubes

DOI10.1016/j.ipl.2008.12.005zbMath1191.68088MaRDI QIDQ976130

Xie-Bin Chen

Publication date: 16 June 2010

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

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

zbMATH Keywords

hypercube; Hamiltonicity; fault-tolerance; panconnectivity; folded hypercube; Hamiltonian-laceability

Mathematics Subject Classification ID

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Construction of optimal independent spanning trees on folded hypercubes, Panconnectivity and edge-pancyclicity of multidimensional torus networks, The spanning connectivity of folded hypercubes, Survey on path and cycle embedding in some networks, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, Cycles embedding on folded hypercubes with faulty nodes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reliability of the folded hypercubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Path embedding in faulty hypercubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• A survey of the theory of hypercube graphs
• The vulnerability of the diameter of folded \(n\)-cubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Forwarding indices of folded \(n\)-cubes
• Linear array and ring embeddings in conditional faulty hypercubes
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Edge-bipancyclicity of conditional faulty hypercubes
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Cycles in folded hypercubes
• Strong Rabin numbers of folded hypercubes
• Complete binary trees in folded and enhanced cubes
• Constructing one-to-many disjoint paths in folded hypercubes
• Hamiltonian-laceability of star graphs
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Some edge‐fault‐tolerant properties of the folded hypercube