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

Enumeration of spanning trees containing a perfect matching in linear polygonal chains

Author

Listed:
  • Lai, Jingchao
  • Zhu, Rongkun

Abstract

The enumerative problem of spanning trees of graphs is one of the fundamental problems in the field of graph theory, which has attracted the attention of mathematicians and physicists. For a connected graph G, let T be a spanning tree of G. In this paper, we call T to be a pm-tree of G if T contains a perfect matching. Recently, Li and Yan (Applied Mathematics and Computation, 456 (2023), 128125.) gave an explicit expression for the number of pm-trees in linear hexagonal chains on the plane, cylinder and Möbius strip, respectively. In this paper, we extend the results above and obtain the explicit formula for the number of pm-trees in linear polygonal chains with n polygons of 4k+2 vertices on the plane, cylinder and Möbius strip, respectively.

Suggested Citation

  • Lai, Jingchao & Zhu, Rongkun, 2024. "Enumeration of spanning trees containing a perfect matching in linear polygonal chains," Applied Mathematics and Computation, Elsevier, vol. 479(C).
    • Handle: RePEc:eee:apmaco:v:479:y:2024:i:c:s0096300324003436
    DOI: 10.1016/j.amc.2024.128882
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324003436
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128882?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:479:y:2024:i:c:s0096300324003436. 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.