English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 23050841      Online Users : 254
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/33692


    Title: The super connectivity of the pancake graphs and the super laceability of the star graphs
    Authors: Lin,CK;Huang,HM;Hsu,LH
    Contributors: 數學研究所
    Keywords: COMPLETE BINARY-TREES;FAULT-DIAMETER;INTERCONNECTION NETWORKS;HAMILTONIAN-LACEABILITY;CYCLES
    Date: 2005
    Issue Date: 2010-07-07 11:41:47 (UTC+8)
    Publisher: 中央大學
    Abstract: A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k*-container if it contains all the vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. L
    Relation: THEORETICAL COMPUTER SCIENCE
    Appears in Collections:[數學研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML383View/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  - 隱私權政策聲明