完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Li, Tseng-Kuei | |
| dc.date.accessioned | 2009-08-23T04:41:29Z | |
| dc.date.accessioned | 2020-05-25T06:38:56Z | - |
| dc.date.available | 2009-08-23T04:41:29Z | |
| dc.date.available | 2020-05-25T06:38:56Z | - |
| dc.date.issued | 2006-10-16T03:55:59Z | |
| dc.date.submitted | 2002-12-18 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1500 | - |
| dc.description.abstract | The star graph is one of the famous interconnection networks. Edge fault tolerance is an important issue for a network. And the cycle embedding problem is widely discussed in many researches. In this paper, we show that the n-dimensional star graph can be embedding cycles of even length from 6 to n! when the number of edge fault does not exceed n − 3. Since the graph is bipartite and (n − 1) regular, our result is optimal. | |
| dc.description.sponsorship | 東華大學,花蓮縣 | |
| dc.format.extent | 9p. | |
| dc.format.extent | 101227 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2002 ICS會議 | |
| dc.subject | star graph | |
| dc.subject | cycle embedding | |
| dc.subject | fault tolerant | |
| dc.subject | pancyclic | |
| dc.title | Cycle Embedding on the Edge Fault Star Graphs | |
| 分類: | 2002年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002002000146.PDF | 98.85 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。