On ``The matching polynomial of a polygraph
From MaRDI portal
Publication:689958
DOI10.1016/0166-218X(93)90159-LzbMATH Open0784.05051MaRDI QIDQ689958FDOQ689958
Authors: Hajo Broersma, Xueliang Li 
Publication date: 16 January 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- The matching polynomial of a polygraph
- Title not available (Why is that?)
- Matchings in benzene chains
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Some general classes of comatching graphs
- The matching polynomial of a regular graph
- A new expression for matching polynomials
- On the matching polynomial of theta graphs.
- On the first Zagreb index of polygraphs
- Title not available (Why is that?)
- Uniqueness of the matching polynomial
- Title not available (Why is that?)
- The matching polynomial of a polygraph
- On the matching polynomial of hypergraphs
- Matching polynomials: A matrix approach and its applications
- Laplacian matching polynomial of graphs
- The higher-order matching polynomial of a graph
- Multivariate matching polynomials of cyclically labelled graphs
- Matchings and walks in graphs
- Title not available (Why is that?)
- On matching integral graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intensional properties of polygraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mean value for the matching and dominating polynomial
This page was built for publication: On ``The matching polynomial of a polygraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689958)
