English  |  正體中文  |  简体中文  |  Items with full text/Total items : 74010/74010 (100%)
Visitors : 24686299      Online Users : 266
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/7848

    Title: Strong Rabin Numbers on Cartesian Products of Graphs
    Authors: 鄭家明;Chia-Ming Cheng
    Contributors: 數學研究所
    Keywords: Cartesian product;strong Rabin numbers
    Date: 2006-06-21
    Issue Date: 2009-09-22 11:07:03 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在互連網路的結構設計上,可靠性、效率、安全性,與是否具有廣播性都是一些很重要的準則。近年來,由「寬直徑」---dw(G)可決定文件傳輸的效率及可靠性,將文件分部分傳輸後再集合至同一目的地。「失效直徑」---Dw(G)可確定資料傳輸的安全性;在傳輸過程中,即使某些點無法使用,資料仍舊可安全送達目的地。而「羅賓數」---rw(G)與「強羅賓數」---r*w(G)則與資料的廣播有關,可將訊息經由網路一次送入多個目的地。經由討論這些參數,網路將可以得到較好的性質。 在這篇學位論文中,我們證明在G×H圖形中的強羅賓數之上界,並藉此探討其d(G×H)、dk(G×H)、Dk(G×H)、rk(G×H)。 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).
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明