Pages that link to "Item:Q1208371"
From MaRDI portal
The following pages link to Bounds on the largest root of the matching polynomial (Q1208371):
Displaying 12 items.
- Further results on the largest matching root of unicyclic graphs (Q512547) (← links)
- Weighted enumeration of spanning subgraphs with degree constraints (Q1003837) (← links)
- On the largest matching roots of graphs with a given number of pendent vertices (Q1727760) (← links)
- On the largest matching roots of graphs with cut edges (Q1751416) (← links)
- Lower bounds on matching energy of graphs (Q2057601) (← links)
- On the location of zeros of the Laplacian matching polynomials of graphs (Q2082524) (← links)
- Extremal matching energy and the largest matching root of complete multipartite graphs (Q2325219) (← links)
- Generalizations of the matching polynomial to the multivariate independence polynomial (Q2328133) (← links)
- On a conjecture of Wilf (Q2384576) (← links)
- On a poset of trees. II (Q2852613) (← links)
- Note on the Smallest Root of the Independence Polynomial (Q4903259) (← links)
- The Largest Roots of the Mandelbrot Polynomials (Q5746442) (← links)