Strong Rabin Numbers on Cartesian Products of Graphs
碩士 === 國立中央大學 === 數學研究所 === 94 === 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 t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/z7nsu5 |
Summary: | 碩士 === 國立中央大學 === 數學研究所 === 94 === 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).
|
---|