English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12186214      Online Users : 452
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/25400

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/25400

    Title: Flexible Cycle Embedding in the Locally Twisted Cube with Nodes Positioned at Any Prescribed Distance
    Authors: 龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
    Contributors: 資訊工程學系
    Keywords: Locally twisted cube;Graph;Interconnection;Hamiltonian;Cycle embedding;Pancyclic
    Date: 2013-09
    Issue Date: 2013-07-11 14:19:47 (UTC+8)
    Abstract: A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x and y of G, it contains a Hamiltonian cycle C such that dC(x, y) = l for any integer l satisfying dG(x, y) ⩽ l ⩽ ⌈∣V(G)∣/2⌉, where dG(x, y) (respectively, dC(x, y)) denotes the distance between vertices x and y in G (respectively, on C), and ∣V(G)∣ is the total number of vertices in G. As the importance of Hamiltonian properties for data communication between units in parallel and distributed systems, the panpositionable Hamiltonicity involves more flexible cycle embedding for message transmission. This paper shows that for two arbitrary nodes x and y of the n-dimensional locally twisted cube LTQn, n ⩾ 4, and for any integer l ∈ {d} ∪ {d + 2, d + 3, d + 4, … , 2n−1}, where d=dLTQn(x,y), there exists a Hamiltonian cycle C of LTQn such that dC(x, y) = l.
    Relation: INFORMATION SCIENCES,242(1):92-102.
    Appears in Collections:[資訊工程學系] 期刊論文

    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