Matching preclusion for k-ary n-cubes with odd k ≥ 3

被引:1
|
作者
Hu, Xiaomin [1 ]
Zhao, Bin [2 ]
Tian, Yingzhi [1 ]
Meng, Jixiang [1 ]
机构
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
[2] Hebei Univ Engn, Sch Math & Phys, Handan 056038, Peoples R China
关键词
Matching preclusion; Matchable; k-ary n-cubes;
D O I
10.1016/j.dam.2017.06.001
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The matching preclusion number of a graph is the minimum number of edges whose deletion results the remaining graph that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the matching preclusion number of k-ary n-cubes is 4n - 1 except k = 3 and n = 2, where k is odd and k >= 3. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:90 / 100
页数:11
相关论文
共 50 条
  • [1] Matching preclusion for k-ary n-cubes
    Wang, Shiying
    Wang, Ruixia
    Lin, Shangwei
    Li, Jing
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (18) : 2066 - 2070
  • [2] Matching Preclusion for Augmented k-ary n-cubes
    ZHANG Xinyuan
    Wuhan University Journal of Natural Sciences, 2015, 20 (01) : 15 - 24
  • [3] Strong matching preclusion for k-ary n-cubes
    Wang, Shiying
    Feng, Kai
    Zhang, Guozhen
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) : 3054 - 3062
  • [4] Augmented k-ary n-cubes
    Xiang, Yonghong
    Stewart, Iain A.
    INFORMATION SCIENCES, 2011, 181 (01) : 239 - 256
  • [5] Mutually Independent Hamiltonian Cycles in k-ary n-cubes when k is odd
    Kao, Shin-Shin
    Wang, Pi-Hsiang
    PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS: RECENT ADVANCES IN APPLIED MATHEMATICS, 2009, : 116 - +
  • [6] Bipanconnectivity and Bipancyclicity in k-ary n-cubes
    Stewart, Iain A.
    Xiang, Yonghong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (01) : 25 - 33
  • [7] On k-ary n-cubes:: theory and applications
    Mao, WZ
    Nicol, DM
    DISCRETE APPLIED MATHEMATICS, 2003, 129 (01) : 171 - 193
  • [8] On some properties of k-Ary n-Cubes
    Sarbazi-Azad, H
    Ould-Khaoua, M
    Mackenzie, LM
    Akl, SG
    PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, : 517 - 524
  • [9] On k-ary n-cubes and isometric words
    Anselmo, Marcella
    Flores, Manuela
    Madonia, Maria
    THEORETICAL COMPUTER SCIENCE, 2022, 938 : 50 - 64
  • [10] Neighbor connectivity of k-ary n-cubes
    Dvorak, Tomas
    Gu, Mei-Mei
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 379