Title of article
Matching polynomials for chains of cycles
Author/Authors
Bian، نويسنده , , Hong and Zhang، نويسنده , , Fuji and Wang، نويسنده , , Guoping and Yu، نويسنده , , Haizheng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
5
From page
319
To page
323
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
k -matching , Matching polynomials , Cactus chain
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599570
Link To Document