Abstract
For a graph with an even number of vertices, the matching preclusion number is the minimum number of edges whose deletion results in a graph with no perfect matchings. The conditional matching preclusion number, introduced as an extension of the matching preclusion number, has the additional requirement that the resulting graph have no isolated vertices. In bipartite graphs, the edge sets that achieve these minimum numbers can be construed in terms of obstruction sets of vertices. From this perspective, the generalized matching preclusion problem was developed; the matching preclusion number of order a is the minimum number of edges whose deletion results in a graph with no perfect matchings and no obstruction sets with fewer than a vertices. In this paper, we extend known sufficient conditions regarding the matching preclusion and conditional matching preclusion numbers (orders 1 and 2, respectively) to give sufficient conditions for the matching preclusion problem of order a, for any positive integer a.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
