Results 211 to 220 of about 2,490 (239)

Matching Preclusion for Enhanced Pyramid Networks

Journal of Interconnection Networks, 2019
The matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph that has neither perfect matchings nor almost perfect matchings. This concept was introduced as a measure of robustness in the event of edge failure in interconnection networks. The pyramid network is one of the important networks applied
XIAQI WEI, SHURONG ZHANG, WEIHUA YANG
openaire   +1 more source

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, Yuhu Liu, Yinkui Li, Eddie Cheng, Yaping Mao   +4 more
openaire   +2 more sources

Strong Matching Preclusion of Arrangement Graphs

Journal of Interconnection Networks, 2016
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph with 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, OMER SIDDIQUI
openaire   +1 more source

Matching Preclusion and Conditional Matching Preclusion of Exchanged Crossed Cube

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

STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS

Journal of Interconnection Networks, 2013
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, DAVID LU, BRIAN XU
openaire   +1 more source

Matching preclusion number in product graphs

Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Zhao, Melekian, Christopher, Cheng, Eddie, Mao, Yaping   +3 more
openaire   +1 more source

CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS

Parallel Processing Letters, 2013
The matching preclusion number of an even graph G, denoted by mp (G), is the minimum number of edges whose deletion leaves the resulting graph without perfect matchings. The conditional matching preclusion number of an even graph G, denoted by mp 1(G), is the minimum number of edges whose deletion leaves the resulting graph with neither perfect ...
Cheng, Eddie, Lipták, László
openaire   +2 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Obesity and adverse breast cancer risk and outcome: Mechanistic insights and strategies for intervention

Ca-A Cancer Journal for Clinicians, 2017
Cynthia Morata-Tarifa, Joyce M Slingerland   +1 more
exaly  

Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma

Ca-A Cancer Journal for Clinicians, 2020
Aaron J Grossberg, William L Hwang, Anirban Maitra   +2 more
exaly