勤益科大機構典藏:Item 987654321/5911
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2928/5721 (51%)
Visitors : 374028      Online Users : 615
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: http://ir.lib.ncut.edu.tw/handle/987654321/5911


    Title: Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity
    Authors: KUNG, Tzu-Liang
    CHEN, Hon-Chan
    Contributors: 圖書館
    Keywords: pancyclic
    vertex-disjoint cycles
    disjoint-cycle cover
    cycle embedding
    crossed cube
    Date: 2015
    Issue Date: 2016-10-18 16:12:42 (UTC+8)
    Abstract: A graph G is two-disjoint-cycle-cover r-pancyclic if for any integer l satisfying r≤l≤|V(G)|-r, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are |V(G)|-l and l, respectively, where |V(G)| denotes the total number of vertices in G. In particular, the graph G is two-disjoint-cycle-cover vertex r-pancyclic if for any two distinct vertices u and v of G, there exist two vertex-disjoint cycles C1 and C2 in G such that (i) C1 contains u, (ii) C2 contains v, and (iii) the lengths of C1 and C2 are |V(G)|-l and l, respectively, for any integer l satisfying r≤l≤|V(G)|-r. Moreover, G is two-disjoint-cycle-cover edge r-pancyclic if for any two vertex-disjoint edges (u,v) and (x,y) of G, there exist two vertex-disjoint cycles C1 and C2 in G such that (i) C1 contains (u,v), (ii) C2 contains (x,y), and (iii) the lengths of C1 and C2 are |V(G)|-l and l, respectively, for any integer l satisfying r≤l≤|V(G)|-r. In this paper, we first give Dirac-type sufficient conditions for general graphs to be two-disjoint-cycle-cover vertex/edge 3-pancyclic, and we also prove that the n-dimensional crossed cube CQn is two-disjoint-cycle-cover 4-pancyclic for n≥3, vertex 4-pancyclic for n≥5, and edge 6-pancyclic for n≥5.
    Relation: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, issue 12, pp. 2670-2676
    Appears in Collections:[Department of Information Management] 【資訊管理系】期刊論文

    Files in This Item:

    There are no files associated with this item.



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


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