Embedding cycles in IEH graphs

DOI10.1016/S0020-0190(97)00147-6zbMATH Open1337.68199OpenAlexW1973475128MaRDI QIDQ287217FDOQ287217

Authors: Hung-Yi Chang, Rong-Jaye Chen 

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

Recommendations

• IEH graphs. A novel generalization of hypercube graphs
• Embedding even-length cycles in a hexagonal honeycomb mesh
• An optimal embedding of cycles into incomplete hypercubes
• Cycle spectra of Hamiltonian graphs
• Mutually independent Hamiltonian cycles in some graphs.

zbMATH Keywords

embeddingHamiltonian cycleshypercubesinterconnection networksincrementally extensible hypercubes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• An optimal embedding of cycles into incomplete hypercubes
• Survey on path and cycle embedding in some networks
• The \(m\)-pancycle-connectivity of a WK-recursive network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287217)