Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs

DOI10.1016/J.DISC.2022.112812MaRDI QIDQ2113369zbMATH OpenOpenAlexFDO

Authors 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

matchingmatching polynomialsubdivisionprinciple of inclusion and exclusionLaplacian matching polynomial

Mathematics Subject Classification ID

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

Recommendations

• Laplacian matching polynomial of graphs
• On the (signless) Laplacian permanental polynomials of graphs
• The average Laplacian polynomial of a graph
• Ordering of trees with fixed matching number by the Laplacian coefficients
• Laplacian coefficients of trees

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Laplacian matching polynomial of graphs
• Matching polynomials and duality
• On the matching polynomial of subdivision graphs
• Problems in algebraic combinatorics
• The average Laplacian polynomial of a graph
• Theory of monomer-dimer systems

Cited in

(3)

• Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
• Laplacian matching polynomial of graphs
• When (signless) Laplacian coefficients meet matchings of subdivision

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113369)