Results 61 to 70 of about 915 (94)

Conditional fractional matching preclusion of n-dimensional torus networks

Discrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Xiaomin, Tian, Yingzhi, Meng, Jixiang, Yang, Weihua   +3 more
openaire   +2 more sources

Conditional Matching Preclusion for Folded Hypercubes

Journal of Interconnection Networks, 2019
Let G be a graph with an even number of vertices. The matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion results in a graph with no isolated vertices and without a perfect ...
RUIZHI LIN, HEPING ZHANG
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

Conditional matching preclusion for regular bipartite graphs and their Cartesian product

Discrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 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, Yuhu Liu, Yinkui Li, Eddie Cheng, Yaping Mao   +4 more
openaire   +2 more sources

Conditional matching preclusion for the alternating group graphs and split-stars

International Journal of Computer Mathematics, 2011
The matching preclusion number of a graph is the minimum number of edges the deletion of which results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Eddie Cheng, László Lipták, Marc J. Lipman, Matthew Toeniskoetter   +3 more
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

Conditional Matching Preclusion Sets for an Mixed-Graph of the Star Graph and the Bubble-Sort Graph

2015
The conditional matching preclusion number of a graph is the minimum number of edges, whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. Any such optimal set is called an optimally conditional matching preclusion set.
Yunxia Ren, Shiying Wang
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
openaire   +1 more source

Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs

International Journal of Computer Mathematics: Computer Systems Theory, 2022
Sambhav Gupta, Eddie Cheng, Lászlo Lipták   +2 more
openaire   +1 more source