Affiliation:
1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
Abstract
The cyclic ladder graph CLn is the Cartesian product of cycles Cn and paths P2, that is CLn=Cn×P2, (n≥3). The di-forcing polynomial of CLn 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 CLn 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 CLn.
Funder
The Innovation Star Program for Excellent Graduate Students in Gansu Province, China
The National Nutural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference30 articles.
1. Trinajstić, N. (1985). nate degrees of freedom of π-electron couplings. In Mathematical and Computational Concepts in Chemistry, Wiley.
2. Innate degree of freedom of a graph;Klein;J. Comput. Chem.,1987
3. Graphical properties of polyhexes: Perfect matching vector and forcing;Harary;J. Math. Chem.,1991
4. Bonds fixed by fixing bonds;Hansen;J. Chem. Inform. Comput. Sci.,1994
5. Hexagonal systems with forcing edges;Zhang;Discret. Math.,1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献