Fault-tolerant Hamiltonicity of twisted cubes

DOI10.1006/JPDC.2001.1813zbMATH Open1008.68017OpenAlexW2086148955MaRDI QIDQ697012FDOQ697012

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

zbMATH Keywords

hypercubeHamiltonian

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computer system organization (68M99)

Cited In (41)

• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
• Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• One-to-one communication in twisted cubes under restricted connectivity
• RVCCC: a new variational network of cube-connected cycles and its topological properties
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
• Independent spanning trees on twisted cubes
• Fractional matching preclusion of graphs
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• Survey on path and cycle embedding in some networks
• Geodesic pancyclicity of twisted cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• The Hamiltonian connectivity of rectangular supergrid graphs
• Hamiltonian cycles and paths in faulty twisted hypercubes
• A Hypercube Variant with Small Diameter
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
• Ring embedding in faulty pancake graphs
• The two-equal-disjoint path cover problem of matching composition network
• Fault-tolerant Hamiltonian connectedness of cycle composition networks
• Locally twisted cubes are 4-pancyclic.
• On some super fault-tolerant Hamiltonian graphs
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Title not available (Why is that?)
• On the extremal number of edges in Hamiltonian connected graphs
• Fault-tolerant pancyclicity of augmented cubes
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• On embedding cycles into faulty twisted cubes
• The family of generalized variational network of cube-connected cycles
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Conditional fault hamiltonian connectivity of the complete graph
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
• Embedding a family of meshes into twisted cubes
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs
• Cubic planar Hamiltonian graphs of various types
• Vertex-pancyclicity of twisted cubes with maximal faulty edges

This page was built for publication: Fault-tolerant Hamiltonicity of twisted cubes

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