Di-Forcing Polynomials for Cyclic Ladder Graphs CL n

Yantong Wang ()
Additional contact information
Yantong Wang: College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Mathematics, 2023, vol. 11, issue 16, 1-16

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 .

Keywords: cyclic ladder graph; perfect matching; forcing number; anti-forcing number; di-forcing polynomials; forcing polynomials; anti-forcing polynomials; generating function (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/16/3598/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/16/3598/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:16:p:3598-:d:1220912

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().