Abstract
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. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults.
Original language | English |
---|---|
Article number | 060205 |
Journal | Theory and Applications of Graphs |
Volume | 6 |
Issue number | 2 |
DOIs | |
State | Published - 2019 |