An optimal embedding of cycles into incomplete hypercubes

DOI10.1016/S0020-0190(99)00139-8zbMath1014.68111OpenAlexW2035106515WikidataQ127472894 ScholiaQ127472894MaRDI QIDQ1607026

Chien-Hung Huang, Ju-Yuan Hsiao, Richard Chia-Tung Lee

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00139-8

zbMATH Keywords

incomplete hypercubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Wiener index via wirelength of an embedding ⋮ An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ On linear layout of bicube and construction of optimal incomplete bicube ⋮ On embedding cycles into faulty twisted cubes

Cites Work

• Embedding cycles in IEH graphs
• On the embedding of cycles in pancake graphs
• The complexity of congestion-1 embedding in a hypercube
• Embedding graphs onto the Supercube
• Embedding cycles and meshes onto incomplete hypercubes
• EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗
• Embedding of cycles in arrangement graphs

This page was built for publication: An optimal embedding of cycles into incomplete hypercubes