On embedding cycles into faulty twisted cubes
From MaRDI portal
Publication:2488628
DOI10.1016/j.ins.2005.04.004zbMath1103.68028OpenAlexW2077720550MaRDI QIDQ2488628
Tseng-Kuei Li, Jimmy J. M. Tan, Ming-Chien Yang, Lih-Hsing Hsu
Publication date: 11 May 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2005.04.004
Related Items (36)
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Hamilton paths and cycles in varietal hypercube networks with mixed faults ⋮ Embedding meshes into crossed cubes ⋮ Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Node-disjoint paths in hierarchical hypercube networks ⋮ A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Panpositionable hamiltonicity and panconnectivity of the arrangement graphs ⋮ Geodesic pancyclicity of twisted cubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Weak-vertex-pancyclicity of (\(n,k\))-star graphs ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus ⋮ Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Fault-tolerant embedding of meshes/tori in twisted cubes ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ An optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes ⋮ The bipancycle-connectivity of the hypercube ⋮ Long paths in hypercubes with conditional node-faults ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ Hamiltonian connectivity of the WK-recursive network with faulty nodes ⋮ Survey on path and cycle embedding in some networks
Cites Work
- On ring embedding in hypercubes with faulty nodes and links
- On the embedding of cycles in pancake graphs
- Fault-tolerant Hamiltonicity of twisted cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Cycles in the cube-connected cycles graph
- Pancyclicity of recursive circulant graphs
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- An optimal embedding of cycles into incomplete hypercubes
- Vertex pancyclic graphs
- On pancyclism in Hamiltonian graphs
- Topological properties of twisted cube
- Pancyclicity of hamiltonian line graphs
- Pancyclic graphs. I
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Generalized de Bruijn digraphs
- The Mobius cubes
- Embedding binary trees into crossed cubes
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- Cycles in butterfly graphs
This page was built for publication: On embedding cycles into faulty twisted cubes
