Fractional matching preclusion of the restricted HL-graphs

被引：4
|
作者：
Zhang, Shunzhe [1 ]
Liu, Huiqing [1 ]
Li, Dong [1 ]
Hu, Xiaolan [2 ]
机构：
[1] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Peoples R China
[2] Cent China Normal Univ, Hubei Key Lab Math Sci, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2019年 / 38卷 / 04期
关键词：
Fractional perfect matching; Fractional matching preclusion number; Fractional strong matching preclusion number; Restricted HL-graphs; PERFECT MATCHINGS; HYPERCUBE; CONNECTIVITY;
D O I：
10.1007/s10878-019-00441-x
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The fractional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings, and the fractional strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion leaves a resulting graph with no fractional perfect matchings. In this paper, we determine these two numbers for the restricted HL-graphs.
引用
收藏
页码：1143 / 1154
页数：12
相关论文
共 50 条
  • [41] Some results on fractional covered graphs
    Yu, Jiguo
    Wang, Na
    Cao, Baoxiang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2006, 6 : 334 - +
  • [42] On the 3-restricted edge connectivity of permutation graphs
    Balbuena, C.
    Gonzalez-Moreno, D.
    Marcote, X.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1586 - 1591
  • [43] On restricted edge-connectivity of replacement product graphs
    Hong ZhenMu
    Xu JunMing
    SCIENCE CHINA-MATHEMATICS, 2017, 60 (04) : 745 - 758
  • [44] On restricted edge-connectivity of replacement product graphs
    ZhenMu Hong
    JunMing Xu
    Science China Mathematics, 2017, 60 : 745 - 758
  • [45] Restricted Edge Connectivity of Binary Undirected Kautz Graphs
    OU Jian-pingDepartment of Mathematics
    Department of Mathematics
    数学季刊, 2004, (01) : 47 - 50
  • [46] On restricted edge-connectivity of replacement product graphs
    HONG ZhenMu
    XU JunMing
    Science China(Mathematics), 2017, 60 (04) : 745 - 758
  • [47] A characterization of nonfeasible sets in matching covered graphs
    Liu, Qinghai
    Cui, Qing
    Feng, Xing
    Lu, Fuliang
    JOURNAL OF GRAPH THEORY, 2020, 95 (04) : 509 - 526
  • [48] Matching covered graphs with three removable classes
    de Carvalho, Marcelo H.
    Little, C. H. C.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (02)
  • [49] The r-Restricted Connectivity of Hyper Petersen Graphs
    Wang, Shiying
    IEEE ACCESS, 2019, 7 : 109539 - 109543
  • [50] On k-restricted connectivity of direct product of graphs
    Cheng, Huiwen
    Varmazyar, Rezvan
    Ghasemi, Mohsen
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (08)
12345