Hamiltonian properties on the class of hypercube-like networks

DOI10.1016/j.ipl.2004.03.009zbMath1178.68043OpenAlexW2060984605MaRDI QIDQ2390274

Kyung-Yong Chwa, Chong-Dae Park

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.009

zbMATH Keywords

hypercubesinterconnection networksgraph embeddinghamiltonicitytwisted cubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (33)

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ The bipanconnectivity of bipartite hypercube-like networks ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Bipancyclic properties of faulty hypercubes ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube ⋮ Hamiltonian properties of some compound networks ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube ⋮ Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ A note about some properties of BC graphs ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ On the spanning connectivity and spanning laceability of hypercube-like networks ⋮ The bipancycle-connectivity of the hypercube ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks ⋮ The bicube: an interconnection of two hypercubes ⋮ Survey on path and cycle embedding in some networks ⋮ Minimum neighborhood in a generalized cube ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ Hamiltonian properties on a class of circulant interconnection networks ⋮ Generalized matching networks and their properties ⋮ Component edge connectivity of hypercube-like networks ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

Cites Work

• Unnamed Item
• On generalized twisted cubes
• A new variation on hypercubes with smaller diameter
• Topological properties of the crossed cube architecture
• Recursive circulants and their embeddings among hypercubes
• Updating the hamiltonian problem—A survey
• A new family of bridged and twisted hypercubes
• The twisted N-cube with application to multiprocessing

This page was built for publication: Hamiltonian properties on the class of hypercube-like networks