Graphs with few matching roots
From MaRDI portal
Abstract: We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- Algebraic matching theory
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
- Graphs determined by polynomial invariants
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On characterizing certain graphs with four eigenvalues by their spectra
- On graphs with three eigenvalues
- On the theory of the matching polynomial
- Small regular graphs with four eigenvalues
- Spectra of graphs
- The matching polynomial of a regular graph
- Theory of monomer-dimer systems
Cited in
(10)- Extremal matching energy and the largest matching root of complete multipartite graphs
- THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
- Graphs with six distinct matching roots
- Lower bounds on matching energy of graphs
- Graphs whose certain polynomials have few distinct roots
- scientific article; zbMATH DE number 6310920 (Why is no real title available?)
- TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
- On matching integral graphs
- Further results on the largest matching root of unicyclic graphs
- Graphs with the fewest matchings
This page was built for publication: Graphs with few matching roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367053)
