The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

DOI10.1016/J.DAM.2014.09.006zbMath1304.68140OpenAlexW1987568939MaRDI QIDQ479026

Ruo-Wei Hung

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.006

zbMATH Keywords

hypercube-like networkscrossed cubesedge-disjoint Hamiltonian cyclesedge-fault tolerant Hamiltonicitytransposition networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Symmetric property and reliability of locally twisted cubes ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ A kind of conditional connectivity of Cayley graphs generated by wheel graphs ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes

Cites Work

• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• On the embedding of cycles in pancake graphs
• Fault-tolerant Hamiltonicity of twisted cubes
• Roughness in Cayley graphs
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• Hamiltonian paths in Cayley graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Bisection width of transposition graphs
• Locally twisted cubes are 4-pancyclic.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Complete path embeddings in crossed cubes
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
• 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
• A group-theoretic model for symmetric interconnection networks
• On the bisection width of the transposition network
• Transposition networks as a class of fault-tolerant robust networks
• Embedding binary trees into crossed cubes
• Augmented cubes
• Pancyclicity of Matching Composition Networks under the Conditional Fault Model
• Transposition Graphs

This page was built for publication: The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks