Conditional strong matching preclusion of the pancake graph

被引:0
|
作者
Abdallah, Mohamad [1 ]
Cheng, Eddie [2 ]
机构
[1] Amer Univ Kuwait, Dept Math & Nat Sci, Safat, Kuwait
[2] Oakland Univ, Dept Math & Stat, Rochester, MI USA
关键词
Matching preclusion; pancake graph;
D O I
10.1080/17445760.2022.2066102
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this article, we find the conditional strong matching preclusion number for the pancake graph.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 50 条
  • [21] Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
    Cheng, Eddie
    Hu, Philip
    Jia, Roger
    Liptak, Laszlo
    NETWORKS, 2012, 59 (04) : 349 - 356
  • [22] Fractional Strong Matching Preclusion for DHcube
    Zhang, He
    Zou, Jinyu
    Zhang, Shuangshuang
    Ye, Chengfu
    PARALLEL PROCESSING LETTERS, 2021, 31 (01)
  • [23] The fractional (strong) matching preclusion number of complete k-partite graph
    Luan, Yu
    Lu, Mei
    Zhang, Yi
    THEORETICAL COMPUTER SCIENCE, 2021, 893 : 176 - 182
  • [24] Strong matching preclusion for torus networks
    Wang, Shiying
    Feng, Kai
    THEORETICAL COMPUTER SCIENCE, 2014, 520 : 97 - 110
  • [25] Strong Matching Preclusion of Arrangement Graphs
    Cheng, Eddie
    Siddiqui, Omer
    JOURNAL OF INTERCONNECTION NETWORKS, 2016, 16 (02)
  • [26] Strong matching preclusion for augmented cubes
    Cheng, Eddie
    Shah, Shalin
    Shah, Vyom
    Steffy, Daniel E.
    THEORETICAL COMPUTER SCIENCE, 2013, 491 : 71 - 77
  • [27] Conditional Fractional Matching Preclusion Number of Graphs
    Li, Wen
    Liu, Yuhu
    Li, Yinkui
    Cheng, Eddie
    Mao, Yaping
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025, 36 (02) : 143 - 159
  • [28] Strong matching preclusion number of graphs
    Mao, Yaping
    Wang, Zhao
    Cheng, Eddie
    Melekian, Christopher
    THEORETICAL COMPUTER SCIENCE, 2018, 713 : 11 - 20
  • [29] CONDITIONAL MATCHING PRECLUSION FOR (n, k)-STAR GRAPHS
    Cheng, Eddie
    Liptak, Laszlo
    PARALLEL PROCESSING LETTERS, 2013, 23 (01)
  • [30] Conditional matching preclusion for regular bipartite graphs and their Cartesian product
    Lin, Ruizhi
    DISCRETE APPLIED MATHEMATICS, 2021, 299 : 17 - 25