Results 71 to 80 of about 130 (91)
Some of the next articles are maybe not open access.
The fractional (strong) matching preclusion number of complete k-partite graph
Theoretical Computer Science, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Luan, Mei Lu, Yi Zhang
exaly +3 more sources
A note on the strong matching preclusion problem for data center networks
Information Processing Letters, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaping Mao, Eddie Cheng, Tianlong Ma
exaly +2 more sources
Fractional Strong Matching Preclusion for DHcube
Parallel Processing Letters, 2021Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp. fractional strong matching preclusion set) if [Formula: see text] (resp. [Formula: see text]) contains no fractional perfect
He Zhang +3 more
openaire +2 more sources
Strong Matching Preclusion of Arrangement Graphs
Journal of Interconnection Networks, 2016The 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 0001, Omer Siddiqui
openaire +1 more source
STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS
Journal of Interconnection Networks, 2013The 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, David Lu, Brian Xu
openaire +1 more source
Strong matching preclusion of burnt pancake graphs
International Journal of Parallel, Emergent and Distributed Systems, 2015The 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 +3 more
openaire +1 more source
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs
Parallel Processing Letters, 2020The 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. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure.
Shuangshuang Zhang +3 more
openaire +2 more sources
Strong matching preclusion problem of the folded Petersen cube
International Journal of Computer Mathematics: Computer Systems Theory, 2018A strong matching preclusion set in a graph is a set of vertices and edges whose removal leaves the graph with no perfect matchings or almost perfect matchings.
Eddie Cheng 0001 +5 more
openaire +1 more source
Strong matching preclusion for two-dimensional torus networks
International Journal of Computer Mathematics, 2014The torus network is one of the most popular interconnection networks for massively parallel computing systems. 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.
Kai Feng, Shiying Wang
openaire +1 more source