A new expression for matching polynomials
From MaRDI portal
Publication:409433
DOI10.1016/J.DISC.2011.11.019zbMATH Open1238.05138OpenAlexW2096511391MaRDI QIDQ409433FDOQ409433
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.019
Recommendations
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (10)
- On the largest matching roots of graphs with cut edges
- Title not available (Why is that?)
- Note on the subgraph component polynomial
- The matching polynomials of hypergraphs and weighted hypergraphs
- Uniqueness of the matching polynomial
- Higher order matching polynomial
- The matching polynomial of a polygraph
- Matching polynomials: A matrix approach and its applications
- Title not available (Why is that?)
- Matching polynomials for some nanostar dendrimers
This page was built for publication: A new expression for matching polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409433)