Fault-free Hamiltonian cycles in faulty arrangement graphs

Sun Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

研究成果: 雜誌貢獻期刊論文同行評審

120 引文 斯高帕斯(Scopus)

摘要

The arrangement graph A n,k, which is a generalization of the star graph (n-k = 1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. The structure of the arrangement graph is reviewed and some necessary definitions and notations are introduced. It is shown that Hamiltonian cycles exist in the arrangement graph even when there are edge or vertex faults.

原文???core.languages.en_GB???
頁(從 - 到)223-237
頁數15
期刊IEEE Transactions on Parallel and Distributed Systems
10
發行號3
DOIs
出版狀態已出版 - 1999

指紋

深入研究「Fault-free Hamiltonian cycles in faulty arrangement graphs」主題。共同形成了獨特的指紋。

引用此