Complexity of Deciding the Equality of Matching Numbers
<|reference_start|>Complexity of Deciding the Equality of Matching Numbers: A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and induced matching numbers are defined as the maximum cardinality of such matchings, respectively, and are known to be NP-hard to compute. In this paper, we study the relationship between these two parameters and the matching number. In particular, we discuss the complexity of two decision problems; first: deciding if the matching number and disconnected matching number are equal; second: deciding if the disconnected matching number and induced matching number are equal. We show that given a bipartite graph with diameter four, deciding if the matching number and disconnected matching number are equal is NP-complete; the same holds for bipartite graphs with maximum degree three. We characterize diameter three graphs with equal matching number and disconnected matching number, which yields a polynomial time recognition algorithm. Afterwards, we show that deciding if the induced and disconnected matching numbers are equal is co-NP-complete for bipartite graphs of diameter 3. When the induced matching number is large enough compared to the maximum degree, we characterize graphs where these parameters are equal, which results in a polynomial time algorithm for bounded degree graphs.<|reference_end|>
@article{gomes2024complexity,
    title={Complexity of Deciding the Equality of Matching Numbers},
    author={Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto, Dieter
  Rautenbach, Vinicius F. dos Santos, Jayme L. Szwarcfiter, Florian Werner},
    journal={arXiv preprint arXiv:2409.04855},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.04855},
    primaryClass={cs.DM}
}