| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423507 | Discrete Mathematics | 2011 | 5 Pages |
Abstract
DoÅ¡liÄ and MÃ¥løy (2010) [2] obtained the extremal 6-cactus chains with respect to the number of matchings and of independent sets. Motivated by the prior paper, in this paper we give recurrences for matching polynomials of ortho-chains and meta-chains, and show that they are the h-cactus chains with the most matchings.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hong Bian, Fuji Zhang, Guoping Wang, Haizheng Yu,