Results 221 to 230 of about 664,357 (236)

A Concise Survey of Matching Preclusion in Interconnection Networks

Journal of Interconnection Networks, 2019
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion
Yaping Mao, Eddie Cheng
exaly   +2 more sources

MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS

International Journal of Foundations of Computer Science, 2008
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the alternating group graphs, Cayley graphs generated by 2-trees and the (n,k)-arrangement graphs.
Eddie Cheng 0001, Linda M. Lesniak, Marc J. Lipman, László Lipták   +3 more
openaire   +2 more sources

Strong matching preclusion of burnt pancake graphs

International Journal of Parallel, Emergent and Distributed Systems, 2015
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. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
Eddie Cheng 0001, Justin Kelm, Roi Orzach, Brian Xu   +3 more
openaire   +2 more sources

Matching Preclusion and Conditional Matching Preclusion of Exchanged Crossed Cube

SSRN Electronic Journal, 2022
Bo Zhu, Shumin Zhang, Chengfu Ye
openaire   +1 more source

Fractional matching preclusion of the restricted HL-graphs

Journal of Combinatorial Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shunzhe Zhang, Huiqing Liu, Dong Li, Xiaolan Hu   +3 more
openaire   +3 more sources

Conditional Fractional Matching Preclusion Number of Graphs

International Journal of Foundations of Computer Science
The conditional fractional matching preclusion number (CFMP number for short) [Formula: see text] of a graph [Formula: see text] is the minimum number of edges whose deletion results in a graph without isolated vertices and without fractional perfect matchings.
Wen Li 0016, Yuhu Liu, Yinkui Li, Eddie Cheng 0001, Yaping Mao   +4 more
openaire   +2 more sources

Conditional Fractional Matching Preclusion of n-Dimensional Torus Networks

Discrete Applied Mathematics, 2021
Jixiang Meng, Yingzhi Tian, Weihua Yang
exaly  

Conditional strong matching preclusion of the pancake graph

International Journal of Parallel, Emergent and Distributed Systems, 2022
Mohamad Abdallah, Eddie Cheng 0001
openaire   +2 more sources

The (Conditional) Matching Preclusion for Burnt Pancake Graphs

Discrete Applied Mathematics, 2013
Huiqing Liu, Xiaolan Hu
exaly  

Strong Matching Preclusion for k-Ary n-Cubes

Discrete Applied Mathematics, 2013
Guozhen Zhang, Kai Feng
exaly