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 条

[1] Fractional matching preclusion of the restricted HL-graphs
Shunzhe Zhang
Huiqing Liu
Dong Li
Xiaolan Hu
Journal of Combinatorial Optimization, 2019, 38 : 1143 - 1154
[2] Fractional matching preclusion of graphs
Yan Liu
Weiwei Liu
Journal of Combinatorial Optimization, 2017, 34 : 522 - 533
[3] Fractional matching preclusion of graphs
Liu, Yan
Liu, Weiwei
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 522 - 533
[4] Fractional matching preclusion number of graphs?
Zou, Jinyu
Mao, Yaping
Wang, Zhao
Cheng, Eddie
DISCRETE APPLIED MATHEMATICS, 2022, 311 : 142 - 153
[5] Fractional matching preclusion numbers of Cartesian product graphs
Luan, Yu
Lu, Mei
Zhang, Yi
DISCRETE APPLIED MATHEMATICS, 2023, 338 : 100 - 112
[6] Fractional Strong Matching Preclusion for DHcube
Zhang, He
Zou, Jinyu
Zhang, Shuangshuang
Ye, Chengfu
PARALLEL PROCESSING LETTERS, 2021, 31 (01)
[7] The fractional matching preclusion number of complete n-balanced k-partite graphs
Yu Luan
Mei Lu
Yi Zhang
Journal of Combinatorial Optimization, 2022, 44 : 1323 - 1329
[8] The fractional matching preclusion number of complete n-balanced k-partite graphs
Luan, Yu
Lu, Mei
Zhang, Yi
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (02) : 1323 - 1329
[9] Conditional matching preclusion for the arrangement graphs
Cheng, Eddie
Lipman, Marc J.
Liptak, Laszlo
Sherman, David
THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6279 - 6289
[10] Fractional matching preclusion for crossed cubes
Zou, Jinyu
Ye, Chengfu
Wu, Miaolin
Zhang, Shumin
UTILITAS MATHEMATICA, 2020, 116 : 125 - 137

← 1 2 3 4 5 →