Skip to search formSkip to main contentSkip to account menu

Matching preclusion

In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Circuit rankDegree (graph theory)Distributed algorithmDulmage–Mendelsohn decomposition

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Fractional matching preclusion for butterfly derived networks
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither… 
2017
2017
NP-completeness of anti-Kekulé and matching preclusion problems
Anti-Kekule problem is a concept of chemical graph theory to measure stability of the molecule by precluding its Kekule structure… 
2014
2014
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion destroys… 
2013
2013
Conditional Matching Preclusion For The Star Graphs
The matching preclusion number of an even graph G, denoted by mp(G), is the minimum number of edges whose deletion leaves the… 
2012
2012
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither… 
2012
2012
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results… 
2010
2010
Matching preclusion for the (n, k)-bubble-sort graphs
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither… 
2010
2010
Matching Preclusion and Conditional Matching Preclusion Problems for Twisted Cubes
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither… 
2010
2010
Transnational Class Actions and Interjurisdictional Preclusion
As global markets expand and trans-border disputes multiply, American courts are pressed to certify transnational class actions… 
2008
2008
Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$
The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)