IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i16p3598-d1220912.html
   My bibliography  Save this article

Di-Forcing Polynomials for Cyclic Ladder Graphs CL n

Author

Listed:
  • Yantong Wang

    (College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China)

Abstract

The cyclic ladder graph C L n is the Cartesian product of cycles C n and paths P 2 , that is C L n = C n × P 2 , ( n ≥ 3 ) . The di-forcing polynomial of C L n is a binary enumerative polynomial of all perfect matching forcing and anti-forcing numbers. In this paper, we derive recursive formulas for the di-forcing polynomial of cyclic ladder graph C L n by classifying and counting the matching cases of the associated edges of a given vertex, from which we obtain the number of perfect matching, the forcing and anti-forcing polynomials, and the generating function and by computing some di-forcing polynomials of the lower order C L n .

Suggested Citation

  • Yantong Wang, 2023. "Di-Forcing Polynomials for Cyclic Ladder Graphs CL n," Mathematics, MDPI, vol. 11(16), pages 1-16, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3598-:d:1220912
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/16/3598/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/16/3598/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:16:p:3598-:d:1220912. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.