Fault-tolerant cycle-embedding of crossed cubes
From MaRDI portal
Publication:1029001
DOI10.1016/j.ipl.2003.08.007zbMath1178.68092OpenAlexW2051916444MaRDI QIDQ1029001
Lih-Hsing Hsu, Tseng-Kuei Li, Ming-Chien Yang, Jimmy J. M. Tan
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2003.08.007
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (33)
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Hamilton paths and cycles in varietal hypercube networks with mixed faults ⋮ Node-pancyclicity and edge-pancyclicity of crossed cubes ⋮ Embedding meshes into crossed cubes ⋮ Cycles passing through prescribed edges in a hypercube with some faulty edges ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ Conditional fault diameter of crossed cubes ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ Embedding a mesh of trees in the crossed cube ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Embedding a long fault-free cycle in a crossed cube with more faulty nodes ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Constructing optimal subnetworks for the crossed cube network ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ On embedding cycles into faulty twisted cubes ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube ⋮ The conditional diagnosability of crossed cubes under the comparison model ⋮ Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Survey on path and cycle embedding in some networks ⋮ Paths in Möbius cubes and crossed cubes ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
This page was built for publication: Fault-tolerant cycle-embedding of crossed cubes
