Live briefing
Everything about Matching preclusion
Robustness of graph perfect matchings
In graph theory, a branch of mathematics, the matching preclusion number of a graph, denoted, is the minimum number of edges whose deletion results in the elimination of all perfect matchings or near-perfect matchings. Matching preclusion measures the quality of a graph as a communications network topology for distributed algorithms that require each node of the distributed system to be matched with a neighboring partner node. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Matching preclusionA 5-minute orientation
- Skim a recent paper: Fractional matching preclusion number of graphsInfluential work since 2022
- Read the landmark paper: Conditional matching preclusion setsCited 90 times
- Go sideways: Starlike treeA closely related topic
- Go sideways: Hypergraph regularity methodA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Conditional matching preclusion sets
Matching preclusion for some interconnection networks
Matching preclusion for balanced hypercubes
Matching preclusion and conditional matching preclusion for regular interconnection networks
Strong matching preclusion
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
Fractional matching preclusion of graphs
🆕 Influential since 2022
Fractional matching preclusion number of graphs
Matching preclusion and conditional matching preclusion for hierarchical cubic networks
Integer k-matching preclusion of some interconnection networks
Fractional matching preclusion numbers of Cartesian product graphs
Higher order matching preclusion for regular interconnection networks
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Starlike tree In the mathematical subdiscipline of graph theory, a tree is said to be starlike if it has exactly one vertex of degree greater than 2. This high-degree…
- Hypergraph regularity method In mathematics, the hypergraph regularity method is a powerful tool in extremal graph theory that refers to the combined application of the hypergraph…
- Atom-bond connectivity index The atom-bond connectivity index (ABC index) is a topological index in chemical graph theory that combines information from both vertices (atoms) and edges…
- Certified dominating set In graph theory, a certified dominating set of a graph is a type of dominating set in which every vertex in the set has either zero or at least two neighbours…
- Independent dominating set In graph theory, an independent dominating set for a graph G = ( V , E ) {\displaystyle G=(V,E)} is a subset D ⊆ V {\displaystyle D\subseteq V} that is…
- Incidence coloring In graph theory, the act of coloring generally implies the assignment of labels to vertices, edges or faces in a graph. The incidence coloring is a special…
- Kőnig's theorem (graph theory) In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem…
- Degree (graph theory) In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes…