完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lin, Chin-Tsai | |
| dc.date.accessioned | 2009-06-02T06:19:14Z | |
| dc.date.accessioned | 2020-05-25T06:38:05Z | - |
| dc.date.available | 2009-06-02T06:19:14Z | |
| dc.date.available | 2020-05-25T06:38:05Z | - |
| dc.date.issued | 2006-10-27T01:33:37Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2638 | - |
| dc.description.abstract | The paper computes the exact fault diameter of the Cayley graphs based on the alternating group. The fault diameter of a graph is the maximum diameter achieved when we delete from the original graph any set of nodes that is smaller than its node connectivity. Based on the algebraic properties of the generators, we show that the fault diameter is the original diameter plus one. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 135837 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject | Interconnection networks | |
| dc.subject | alternating group | |
| dc.subject | Cayley graphs | |
| dc.subject | fault diameter | |
| dc.subject.other | Interconnection Network | |
| dc.title | Fault Diameter of the Cayley Graphs Based on the Alternating Group | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000060.pdf | 132.65 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。