ASIA unversity:Item 310904400/64352
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21707854      線上人數 : 165
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/64352


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/64352


    題名: Flexible Cycle Embedding in the Locally Twisted Cube with Nodes Positioned at Any Prescribed Distance
    作者: 龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
    貢獻者: 資訊工程學系
    日期: 201309
    上傳時間: 2013-10-29 09:40:19 (UTC+0)
    摘要: 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 d(C)(x,y) = l for any integer l satisfying d(G)(x,y) <= l <= inverted right perpendicular vertical bar V(G)vertical bar/2inverted left perpendicular, where d(G)(x,y) (respectively, d(C)(x,y)) denotes the distance between vertices x and y in G (respectively, on C), and vertical bar V(G)vertical bar 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 LTQ(n), n >= 4, and for any integer l is an element of {d} boolean OR {d + 2, d + 3, d + 4, ..., 2(n-1)}, where d = d(LTQn)(x,y), there exists a Hamiltonian cycle C of LTQ(n) such that d(C)(x,y) = l. (C) 2013 Elsevier Inc. All rights reserved.
    關聯: INFORMATION SCIENCES, 242(1):p92-102.
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML386檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


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