Matching polynomials for chains of cycles

DOI10.1016/j.disc.2010.09.028zbMath1222.05207MaRDI QIDQ626782

Haizheng Yu, Hong Bian, Fu Ji Zhang, Guo-Ping Wang

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.028

zbMATH Keywords

\(k\)-matching; matching polynomials; cactus chain

Mathematics Subject Classification ID

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C40: Connectivity

Related Items

Matching polynomials for some nanostar dendrimers, Unnamed Item, A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types, Closed formulas for the number of small paths, independent sets and matchings in fullerenes, A fast numerical method for fractional partial integro-differential equations with spatial-time delays

Cites Work

• Matchings in hexagonal cacti
• Chain hexagonal cacti: matchings and independent sets
• Recent results in the theory of graph spectra
• An introduction to matching polynomials
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• Polymers with attractive interactions on the Husimi lattice