A note on cycle embedding in folded hypercubes with faulty elements

研究成果: Article同行評審

21 引文 斯高帕斯(Scopus)

摘要

A study was conducted to demonstrate cycle embedding in folded hypercubes with faulty elements. The study found that a n-dimensional hypercube can be represented as an undirected graph consists of 2n nodes labeled as binary numbers of length n. The study also found that the set of edges connects two nodes only if they differ in exactly one bit of their labels and a n-dimensional folded hypercube is a regular n-dimensional hypercube augmented by adding more links among its nodes. The study confirmed that n-dimensional folded hypercube can be obtained by adding a link between two nodes whose addresses are complementary to each other in an n-cube. The study concluded that n-dimensional folded hypercube is regular of the common degree n + 1 and faulty element is worst-case optimal.

原文English
頁數1
期刊Information Processing Letters
108
發行號2
DOIs
出版狀態Published - 2008 九月 30

All Science Journal Classification (ASJC) codes

  • 計算機理論與數學

指紋

深入研究「A note on cycle embedding in folded hypercubes with faulty elements」主題。共同形成了獨特的指紋。

引用此