Matching polynomials for chains of cycles

详细信息    查看全文

• 作者：Hong Bian ; Fuji Zhang ; Guoping Wang ; Haizheng Yu
• 关键词： ; none ; color ; black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-51CHMC7-1&_mathId=mml5&_user=10&_cdi=5632&_pii=S0012365X1000381X&_rdoc=14&_issn=0012365X&_acct=C000050221&_version=1&_userid=10&md5=a3ed
• 刊名：Discrete Mathematics
• 出版年：2011
• 出版时间：28 February 2011
• 年：2011
• 卷：311
• 期：4
• 页码：319-323
• 全文大小：236 K

文摘

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.