Embedding cycles in IEH graphs

DOI10.1016/S0020-0190(97)00147-6zbMath1337.68199OpenAlexW1973475128MaRDI QIDQ287217

Rong-Jaye Chen, Hung-Yi Chang

Publication date: 26 May 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00147-6

zbMATH Keywords

embeddingHamiltonian cycleshypercubesinterconnection networksincrementally extensible hypercubes

Mathematics Subject Classification ID

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

Related Items (2)

The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ An optimal embedding of cycles into incomplete hypercubes

Cites Work

• On the embedding of cycles in pancake graphs
• Supercube: An optimally fault tolerant network architecture
• IEH graphs. A novel generalization of hypercube graphs
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Embedding graphs onto the Supercube
• Embedding of cycles in arrangement graphs

This page was built for publication: Embedding cycles in IEH graphs