Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

DOI10.1016/j.tcs.2011.05.004zbMath1223.68081OpenAlexW2035613389MaRDI QIDQ638549

Ruo-Wei Hung

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.004

zbMATH Keywords

hypercubesinterconnection networkslocally twisted cubesedge-disjoint Hamiltonian cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items

Embedding mutually edge-disjoint cycles into locally twisted cubes ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity ⋮ Hamiltonian properties of honeycomb meshes ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ Characterizations of optimal component cuts of locally twisted cubes ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes ⋮ Conditional edge connectivity of the locally twisted cubes ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

Cites Work

• Unnamed Item
• Unnamed Item
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Fault-tolerant Hamiltonicity of twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Conditional edge-fault Hamiltonicity of augmented cubes
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• On edge-disjoint spanning trees in hypercubes
• Locally twisted cubes are 4-pancyclic.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Panconnectivity of locally twisted cubes
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• On embedding cycles into faulty twisted cubes
• Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Edge-disjoint Hamiltonian cycles in hypertournaments
• The Mobius cubes
• The locally twisted cubes