The Hamiltonicity of generalized honeycomb torus networks

DOI10.1016/J.IPL.2014.07.011zbMath1302.68214OpenAlexW2022607925MaRDI QIDQ477596

Yahui An, Qian Zhao, Qiang Dong

Publication date: 9 December 2014

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

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

zbMATH Keywords

parallel computingHamiltonian cycleinterconnection networkgeneralized honeycomb torus

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Efficient domination in Cayley graphs of generalized dihedral groups

Cites Work

• Generalized honeycomb torus is Hamiltonian
• Generalized honeycomb torus
• Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
• Honeycomb tori are Hamiltonian
• Unnamed Item

This page was built for publication: The Hamiltonicity of generalized honeycomb torus networks