Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs

DOI10.1016/J.DISC.2022.112812zbMATH Open1484.05106OpenAlexW4206643543MaRDI QIDQ2113369FDOQ2113369

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

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

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)

Cites Work

• Title not available (Why is that?)
• Theory of monomer-dimer systems
• Problems in algebraic combinatorics
• On the matching polynomial of subdivision graphs
• Matching polynomials and duality
• Laplacian matching polynomial of graphs
• The average Laplacian polynomial of a graph

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)