English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12186334      Online Users : 377
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/18721


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


    Title: Embedding a Hamiltonian Cycle in the Crossed Cube with Two Required Vertices in the Fixed Positions
    Authors: 龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
    Contributors: 資訊工程學系
    Keywords: Hamiltonian;Pancyclic;Cycle embedding;Interconnection network;Crossed cube
    Date: 2011-08
    Issue Date: 2012-11-26 13:57:36 (UTC+8)
    Abstract: A Hamiltonian graph G is said to be panpositionably Hamiltonian if, for any two distinct vertices x and y of G , there is a Hamiltonian cycle C of G having d C(x , y ) = l for any integer l satisfying View the MathML source, where dG(x, y) (respectively, dC(x, y)) denotes the distance between vertices x and y in G (respectively, C), and ∣V(G)∣ denotes the total number of vertices of G. As the importance of Hamiltonian properties for data communication among units in an interconnected system, the panpositionable Hamiltonicity involves more flexible message transmission. In this paper, we study this property with respect to the class of crossed cubes, which is a popular variant of the hypercube network.
    Relation: APPLIED MATHEMATICS AND COMPUTATION; 217(24):10058–10065
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML174View/Open


    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