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


    Title: The super spanning connectivity and super spanning laceability of the enhanced hypercubes
    Authors: Chang,CH;Lin,CK;Tan,JJM;Huang,HM;Hsu,LH
    Contributors: 數學研究所
    Keywords: GRAPHS;NETWORKS
    Date: 2009
    Issue Date: 2010-06-29 19:39:06 (UTC+8)
    Publisher: 中央大學
    Abstract: A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k (*) -container if it contains all vertices of G. A graph G is k (*) -connected if there exists a k (*)-container between any two distinct vertices of G. Therefore, a graph is 1(*)-connected (respectively, 2(*)-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k (*)-container between any two distinct vertices of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G) where kappa(G) is the connectivity of G. A bipartite graph G is k (*) -laceable if there exists a k (*)-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k (*)-container between any two vertices from different partite set of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G). In this paper, we prove that the enhanced hypercube Q (n,m) is super spanning laceable if m is an odd integer and super spanning connected if otherwise.
    Relation: JOURNAL OF SUPERCOMPUTING
    Appears in Collections:[數學研究所] 期刊論文

    Files in This Item:

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