Embedding of hypercubes into necklace, windmill and snake graphs

作者：Rajasingh Indra; Rajan Bharati; Rajan R Sundara^*

来源：Information Processing Letters, 2012, 112(12): 509-515.

DOI：10.1016/j.ipl.2012.03.006

• Interconnection networks
• Embedding
• Congestion
• Wirelength
• Edge isoperimetric problem
• Hypercubes

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs.

• 出版日期2012-6-30