Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

DOI10.1016/J.TCS.2011.05.004MaRDI QIDQ638549zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
• The locally twisted cubes
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Weakly edge-pancyclicity of locally twisted cubes
• Fault-tolerant edge-pancyclicity of locally twisted cubes

Cites work

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

Cited in

(21)

• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• Characterizations of optimal component cuts of locally twisted cubes
• The locally twisted cubes
• Edge-disjoint Hamiltonian cycles of balanced hypercubes
• 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
• Conditional edge connectivity of the locally twisted cubes
• Weakly edge-pancyclicity of locally twisted cubes
• Improving the panconnectedness property of locally twisted cubes
• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
• Embedding mutually edge-disjoint cycles into locally twisted cubes
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
• Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity
• Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
• Hamiltonian properties of honeycomb meshes
• Star graph automorphisms and disjoint Hamilton cycles
• Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

This page was built for publication: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

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