Results 81 to 90 of about 130 (91)

STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS

Journal of Interconnection Networks, 2011
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 and has recently been introduced by Park and Ihm.15In this paper, we examine properties of strong matching
Philip Bonneville, Eddie Cheng 0001, Joseph Renzi   +2 more
openaire   +1 more source

Conditional strong matching preclusion of the pancake graph

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

Integer k-matching preclusion of twisted cubes and (n,s)-star graphs

Applied Mathematics and Computation, 2023
Yan Liu
exaly  

Strong matching preclusion for folded hypercubes

Discrete Applied Mathematics
Zhicheng Lin, Ruizhi Lin
openaire   +1 more source

Strong matching preclusion for two-dimensional torus networks

International Journal of Computer Mathematics, 2015
Shiying Wang, Kai Feng
exaly  

Matching preclusion for direct product of regular graphs

Discrete Applied Mathematics, 2020
Heping Zhang, Ruizhi Lin, Weisheng Zhao   +2 more
exaly  

Strong matching preclusion problem of the folded Petersen cube

International Journal of Computer Mathematics: Computer Systems Theory, 2019
Eddie Cheng
exaly  

Fractional matching preclusion for arrangement graphs

Discrete Applied Mathematics, 2019
Yaping Mao, Jinling Wang, Eddie Cheng
exaly  

Matching preclusion for balanced hypercubes

Theoretical Computer Science, 2012
Heping Zhang, Xianyue Li, Huazhong Lu
exaly  

Fractional matching preclusion of the restricted HL-graphs

Journal of Combinatorial Optimization, 2019
Huiqing Liu, Xiaolan Hu, Xiaolan Hu
exaly