English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23113385      Online Users : 111
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/33669


    Title: On the spanning w-wide diameter of the star graph
    Authors: Lin,Cheng-Kuan;Huang,Hua-Min;Hsu,D. Frank;Hsu,Lih-Hsing
    Contributors: 數學研究所
    Keywords: FAULT-FREE PATHS;HAMILTONIAN-LACEABILITY;SUPER LACEABILITY;PANCAKE GRAPHS;VERTEX FAULTS;NETWORKS;HYPERCUBES;TREES
    Date: 2006
    Issue Date: 2010-07-07 11:41:00 (UTC+8)
    Publisher: 中央大學
    Abstract: Let a and v be any two distinct nodes of an undirected graph G, which is k-connected. A container C(u, v) between a and v is a set of internally disjoint paths {P-1, P-2,..., P-W} between a and v where 1 <= w <= k. The width of C(u, v) is w and the length
    Relation: NETWORKS
    Appears in Collections:[數學研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML264View/Open


    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 ©   - Feedback  - 隱私權政策聲明