Hamiltonian-like properties of k-ary n-cubes

被引：0
|
作者：
Wang, DQ [1 ]
An, T [1 ]
Pan, MY [1 ]
Wang, KL [1 ]
Qu, SY [1 ]
机构：
[1] Dalian Maritime Univ, Nat Sci & Technol Inst, Dalian 116026, Peoples R China
来源：
PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS | 2005年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Some Hamiltonian-like properties of k-ary n-cube are explored In this paper, we show that k-ary 2-cube is almost Hamiltonian-connected, bipanconnected, bipancyclic. And we prove that k-ary n-cube is almost Hamiltonian-connected when n >= 3, and Hamiltonian-connected if k is odd.
引用
收藏
页码：1002 / 1007
页数：6
相关论文
共 50 条
  • [41] Increasing the adaptivity of routing algorithms for k-ary n-cubes
    Baydal, E
    López, P
    Duato, J
    10TH EUROMICRO WORKSHOP ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2002, : 455 - 462
  • [42] Panconnectivity and Edge-Pancyclicity of k-Ary n-Cubes
    Hsieh, Sun-Yuan
    Lin, Tsong-Jie
    NETWORKS, 2009, 54 (01) : 1 - 11
  • [43] Matching preclusion for k-ary n-cubes with odd k ≥ 3
    Hu, Xiaomin
    Zhao, Bin
    Tian, Yingzhi
    Meng, Jixiang
    DISCRETE APPLIED MATHEMATICS, 2017, 229 : 90 - 100
  • [44] THE CONNECTIVITY AND NATURE DIAGNOSABILITY OF EXPANDED k-ARY n-CUBES
    Wang, Mujiangshan
    Lin, Yuqing
    Wang, Shiying
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2017, 51 (02): : 71 - 89
  • [45] Mapping a class of neural networks on k-ary n-cubes
    Arad, BS
    El-Amawy, A
    TELECOMMUNICATION SYSTEMS, 1998, 10 (1-2) : 67 - 78
  • [46] Embedding Hamiltonian Paths in k-Ary n-Cubes With Exponentially-Many Faulty Edges
    Zhuang, Hongbin
    Li, Xiao-Yan
    Chang, Jou-Ming
    Lin, Cheng-Kuan
    Liu, Ximeng
    IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (11) : 3245 - 3258
  • [47] Analysis of deterministic routing in k-ary n-cubes with virtual channels
    Sarbazi-Azad, H
    Khonsari, A
    Ould-Khaoua, M
    PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, : 509 - 516
  • [48] RESOURCE PLACEMENT WITH MULTIPLE ADJACENCY CONSTRAINTS IN K-ARY N-CUBES
    RAMANATHAN, P
    CHALASANI, S
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (05) : 511 - 519
  • [49] Performance analysis of k-ary n-cubes with fully adaptive routing
    Sarbazi-Azad, H
    Ould-Khaoua, M
    Mackenzie, LM
    SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2000, : 249 - 255
  • [50] Embedding various cycles with prescribed paths into k-ary n-cubes
    Yang, Yuxing
    Li, Jing
    Wang, Shiying
    DISCRETE APPLIED MATHEMATICS, 2017, 220 : 161 - 169
12345