DC 欄位 |
值 |
語言 |
DC.contributor | 數學系 | zh_TW |
DC.creator | 鄭家明 | zh_TW |
DC.creator | Chia-Ming Cheng | en_US |
dc.date.accessioned | 2006-6-26T07:39:07Z | |
dc.date.available | 2006-6-26T07:39:07Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=91221011 | |
dc.contributor.department | 數學系 | zh_TW |
DC.description | 國立中央大學 | zh_TW |
DC.description | National Central University | en_US |
dc.description.abstract | 在互連網路的結構設計上,可靠性、效率、安全性,與是否具有廣播性都是一些很重要的準則。近年來,由「寬直徑」---dw(G)可決定文件傳輸的效率及可靠性,將文件分部分傳輸後再集合至同一目的地。「失效直徑」---Dw(G)可確定資料傳輸的安全性;在傳輸過程中,即使某些點無法使用,資料仍舊可安全送達目的地。而「羅賓數」---rw(G)與「強羅賓數」---r*w(G)則與資料的廣播有關,可將訊息經由網路一次送入多個目的地。經由討論這些參數,網路將可以得到較好的性質。
在這篇學位論文中,我們證明在G×H圖形中的強羅賓數之上界,並藉此探討其d(G×H)、dk(G×H)、Dk(G×H)、rk(G×H)。 | zh_TW |
dc.description.abstract | In the design of interconnection networks, reliability and efficiency are important
criteria. Recently, the w-wide diameter dw(G), the (w − 1)-fault diameter
Dw(G), and the w-Rabin number rw(G) have been used to measure network reliability
and efficiency. In this thesis, we study these parameters using the strong
w-Rabin number r*w (G). We show that r*k1+k2(G×H) is less than or equal to
max{r*k1(G)+r*k2(H), d(G)+2, d(H) + 2}, where k1 = k(G) and k2 = k(H). | en_US |
DC.subject | Cartesian product | en_US |
DC.subject | strong Rabin numbers | en_US |
DC.title | Strong Rabin Numbers on Cartesian Products of Graphs | en_US |
dc.language.iso | en_US | en_US |
DC.type | 博碩士論文 | zh_TW |
DC.type | thesis | en_US |
DC.publisher | National Central University | en_US |