Hamiltonian properties on the class of hypercube-like networks

DOI10.1016/j.ipl.2004.03.009zbMath1178.68043MaRDI 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

hypercubes; interconnection networks; graph embedding; hamiltonicity; twisted cubes

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

Related Items

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