Results 141 to 150 of about 210 (161)

Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs

open access: closedInternational Journal of Parallel, Emergent and Distributed Systems, 2013
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion destroys all perfect matchings in the graph. The optimal matching preclusion sets are often precisely those which are induced by a single vertex of minimum degree.
Eddie Cheng 0001   +5 more
openaire   +2 more sources

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

open access: closedParallel 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 ...
Eddie Cheng 0001, László Lipták
openaire   +3 more sources

Conditional Fractional Matching Preclusion Number of Graphs

open access: closedInternational 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   +4 more
openaire   +3 more sources

Conditional fractional matching preclusion of n-dimensional torus networks

open access: closedDiscrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Hu   +3 more
openaire   +3 more sources

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

open access: closedInternational 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 0001   +3 more
openaire   +2 more sources

Conditional strong matching preclusion of the pancake graph

open access: closedInternational Journal of Parallel, Emergent and Distributed Systems, 2022
Mohamad Abdallah, Eddie Cheng 0001
openaire   +2 more sources

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

open access: closedInternational Journal of Computer Mathematics: Computer Systems Theory, 2022
Sambhav Gupta   +2 more
openaire   +2 more sources

Conditional Matching Preclusion Number of Certain Graphs

open access: closedINTERNATIONAL JOURNAL OF COMPUTING ALGORITHM, 2014
Antony Xavier D, Maria Jesu Raja S
openaire   +2 more sources

Conditional Matching Preclusion For The Star Graphs.

open access: closedArs Comb., 2015
Eddie Cheng 0001   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy