Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs

DOI10.1016/j.disc.2022.112812zbMath1484.05106OpenAlexW4206643543MaRDI QIDQ2113369

Danyi Li, Weigen Yan

Publication date: 14 March 2022

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

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

zbMATH Keywords

matchingsubdivisionmatching polynomialprinciple of inclusion and exclusionLaplacian matching polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Matching polynomials and duality
• On the matching polynomial of subdivision graphs
• Problems in algebraic combinatorics
• The average Laplacian polynomial of a graph
• Laplacian matching polynomial of graphs
• Theory of monomer-dimer systems

This page was built for publication: Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs