共 50 条
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
关键词:
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
相关论文