The matching polynomial of a regular graph
From MaRDI portal
Publication:1343771
DOI10.1016/0012-365X(93)E0125-NzbMATH Open0813.05049MaRDI QIDQ1343771FDOQ1343771
Authors: Robert A. Beezer, E. J. Farrell
Publication date: 6 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (18)
- Title not available (Why is that?)
- A Pfaffian formula for matching polynomials of outerplanar graphs
- Graphs determined by polynomial invariants
- On a conjecture of Wilf
- Local WL invariance and hidden shades of regularity
- Graphs with six distinct matching roots
- The new methods for constructing matching-equivalence graphs
- Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
- On sequences of polynomials arising from graph invariants
- The matching polynomial of a polygraph
- On the matching polynomial of hypergraphs
- More on the sixth coefficient of the matching polynomial in regular graphs
- Title not available (Why is that?)
- Counting matchings and tree-like walks in regular graphs
- Matching polynomials for some nanostar dendrimers
- Graphs with few matching roots
- Counting configurations in designs
- The graph polynomial and the number of proper vertex colorings
This page was built for publication: The matching polynomial of a regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343771)