Cycles passing through prescribed edges in a hypercube with some faulty edges

DOI10.1016/J.IPL.2007.06.014zbMATH Open1184.68113OpenAlexW2024878111MaRDI QIDQ2380025FDOQ2380025

Xiebin Chen

Publication date: 24 March 2010

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

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

zbMATH Keywords

hypercubeembeddingcyclefault toleranceinterconnection networksedge fault tolerance

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• Graph theory
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Cycles in folded hypercubes
• Title not available (Why is that?)
• Fault-tolerant cycle-embedding of crossed cubes
• Edge-pancyclic block-intersection graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• A survey of the theory of hypercube graphs
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements

Cited In (27)

• Hamiltonicity of hypercubes with faulty vertices
• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Survey on path and cycle embedding in some networks
• Bipanconnectivity of faulty hypercubes with minimum degree
• Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Cycles passing through a prescribed path in a hypercube with faulty edges
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• On path bipancyclicity of hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• A note on cycle embedding in hypercubes with faulty vertices
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• The 2-path-bipanconnectivity of hypercubes
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• Some results on topological properties of folded hypercubes
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

This page was built for publication: Cycles passing through prescribed edges in a hypercube with some faulty edges

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