Fault-tolerant Hamiltonicity of twisted cubes
From MaRDI portal
Publication:697012
DOI10.1006/jpdc.2001.1813zbMath1008.68017OpenAlexW2086148955MaRDI QIDQ697012
Jimmy J. M. Tan, Lih-Hsing Hsu, Chun-Nan Hung, Wen-Tzeng Huang
Publication date: 12 September 2002
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cad4c78c53c912666a52d3ee61e3abc1777cd572
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computer system organization (68M99)
Related Items (39)
Fault-tolerant pancyclicity of augmented cubes ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ One-to-one communication in twisted cubes under restricted connectivity ⋮ Fractional matching preclusion of graphs ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ The family of generalized variational network of cube-connected cycles ⋮ Geodesic pancyclicity of twisted cubes ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Edge-pancyclicity and Hamiltonian connectivity of twisted cubes ⋮ On some super fault-tolerant Hamiltonian graphs ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Unnamed Item ⋮ Independent spanning trees on twisted cubes ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ 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 ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Fault-tolerant Hamiltonian connectedness of cycle composition networks ⋮ The two-equal-disjoint path cover problem of matching composition network ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ Locally twisted cubes are 4-pancyclic. ⋮ On embedding cycles into faulty twisted cubes ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Embedding a family of meshes into twisted cubes ⋮ Cubic planar Hamiltonian graphs of various types ⋮ A recursively construction scheme for super fault-tolerant Hamiltonian graphs ⋮ Conditional fault hamiltonian connectivity of the complete graph ⋮ Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks ⋮ Edge-fault-tolerant node-pancyclicity of twisted cubes ⋮ Fault-tolerant Hamiltonian connectivity of the WK-recursive networks ⋮ Ring embedding in faulty pancake graphs ⋮ A Hypercube Variant with Small Diameter ⋮ Survey on path and cycle embedding in some networks ⋮ On the extremal number of edges in Hamiltonian connected graphs ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
This page was built for publication: Fault-tolerant Hamiltonicity of twisted cubes
