Longest fault-free paths in star graphs with edge faults

Sun Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

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

58 引文 斯高帕斯(Scopus)

摘要

In this paper, we aim to embed longest fault-free paths in an n-dimensional star graph with edge faults. When n ≥ 6 and there are n - 3 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices, exclusive of two exceptions in which at most two vertices are excluded. Since the star graph is regular of degree n - 1, n - 3 (edge faults) is maximal in the worst case. When n ≥ 6 and there are n - 4 edge faults, a longest fault-free path can be embedded between two arbitrary distinct vertices. The situation of n < 6 is also discussed.

原文???core.languages.en_GB???
頁(從 - 到)960-971
頁數12
期刊IEEE Transactions on Computers
50
發行號9
DOIs
出版狀態已出版 - 9月 2001

指紋

深入研究「Longest fault-free paths in star graphs with edge faults」主題。共同形成了獨特的指紋。

引用此