ASIA unversity:Item 310904400/65318
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90437/105768 (86%)
Visitors : 10938896      Online Users : 596
RC Version 6.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:

    Title: The Two-Disjoint-Path-Coverable Problem of Crossed Cubes
    Authors: Chen, Hon-Chan;Kung, Tzu-Liang;Hsu, Li-Yen
    Contributors: 資訊工程學系
    Keywords: Hamiltonian, Disjoint path cover, Path length, Interconnection network, Crossed cube
    Date: 2013-12
    Issue Date: 2013-12-18 10:42:56 (UTC+8)
    Abstract: A graph G is 2-disjoint-path-coverable (2-DPC) if, for any four distinct vertices u, v, x, and y of G, there exist two vertex-disjoint paths P1 and P2 such that (i) P1 joins u and v, (ii) P2 joins x and y, and (iii) P1 ∪ P2 spans G. In this paper, we investigate the 2-DPC problem of the crossed cube with various path lengths. In particu-lar, we prove that the crossed cube can be spanned by two disjoint paths P1 of length l1 and P2 of length l2, where 2n–2 – 1 ? l1 ? 2n–1 – 1 and l2 = 2n – l1 – 2. This result im-proves on the previous one that the two disjoint paths are of equal length.
    Relation: 2013全國計算機會議
    Appears in Collections:[Department of Computer Science and Information Engineering] Proceedings

    Files in This Item:

    File SizeFormat

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

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback