IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v500y2025ics0096300325001596.html
   My bibliography  Save this article

Maximal and maximum induced matchings in connected graphs

Author

Listed:
  • Yuan, Bo-Jun
  • Yang, Zhao-Yu
  • Zheng, Lu
  • Gong, Shi-Cai

Abstract

An induced matching is defined as a set of edges whose end-vertices induce a subgraph that is 1-regular. Building upon the work of Gupta et al. (2012) [11] and Basavaraju et al. (2016) [1], who determined the maximum number of maximal induced matchings in general and triangle-free graphs respectively, this paper extends their findings to connected graphs with n vertices. We establish a tight upper bound on the number of maximal and maximum induced matchings, as detailed below:{(n2)if1≤n≤8;(⌊n2⌋2)⋅(⌈n2⌉2)−(⌊n2⌋−1)⋅(⌈n2⌉−1)+1if9≤n≤13;10n−15+n+14430⋅6n−65if14≤n≤30;10n−15+n−15⋅6n−65ifn≥31. This result not only provides a theoretical upper bound but also implies a practical algorithmic application: enumerating all maximal induced matchings of an n-vertex connected graph in time O(1.5849n). Additionally, our work offers an estimate for the number of maximal dissociation sets in connected graphs with n vertices.

Suggested Citation

  • Yuan, Bo-Jun & Yang, Zhao-Yu & Zheng, Lu & Gong, Shi-Cai, 2025. "Maximal and maximum induced matchings in connected graphs," Applied Mathematics and Computation, Elsevier, vol. 500(C).
    • Handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001596
    DOI: 10.1016/j.amc.2025.129432
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001596
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129432?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001596. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.