IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v510y2026ics0096300325004291.html

Enumerating the number of k-matchings in successively amalgamated graphs

Author

Listed:
  • Grad, Simon
  • Klavžar, Sandi

Abstract

In this paper, the transfer matrix technique using the k-matching vector is developed to compute the number of k-matchings in an arbitrary graph which can be constructed by successive amalgamations over sets of cardinality two. This widely extends known methods from the literature developed for computing the number of k-matchings in benzenoid chains, octagonal chains, cyclooctatetraene chains, and arbitrary cyclic chains. Two examples demonstrating how the present method can be applied are given, one of them being an elaborated chemical example.

Suggested Citation

  • Grad, Simon & Klavžar, Sandi, 2026. "Enumerating the number of k-matchings in successively amalgamated graphs," Applied Mathematics and Computation, Elsevier, vol. 510(C).
    • Handle: RePEc:eee:apmaco:v:510:y:2026:i:c:s0096300325004291
    DOI: 10.1016/j.amc.2025.129703
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325004291
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129703?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Shi, Lingjuan & Deng, Kai, 2023. "Counting the maximal and perfect matchings in benzenoid chains," Applied Mathematics and Computation, Elsevier, vol. 447(C).
    2. Aleksander Vesel, 2021. "Linear Algorithms for the Hosoya Index and Hosoya Matrix of a Tree," Mathematics, MDPI, vol. 9(2), pages 1-11, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Keywords

      ;
      ;
      ;
      ;
      ;

      Statistics

      Access and download statistics

      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:510:y:2026:i:c:s0096300325004291. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.