Algebraic matching theory
From MaRDI portal
Recommendations
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials
- scientific article; zbMATH DE number 2140696
- Generalizing Tutte's theorem and maximal non-matchable graphs
Cited in
(31)- The independence number of the strong product of cycles
- Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners
- Null decomposition of trees
- Improved lower bound on the Shannon capacity of C₇
- Lower bounds on matching energy of graphs
- Atoms of the matching measure
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials
- On matching integral graphs
- Graphs with six distinct matching roots
- Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
- Gallai-Edmonds structure theorem for weighted matching polynomial
- The acyclic matrices with a P-set of maximum size
- Trace-minimal graphs and D-optimal weighing designs
- Graphs with few matching roots
- Generalizing Tutte's theorem and maximal non-matchable graphs
- Properties of \(\theta\)-super positive graphs
- scientific article; zbMATH DE number 2140696 (Why is no real title available?)
- Graphs whose certain polynomials have few distinct roots
- THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
- Matching Energy of Graphs with Maximum Degree at Most 3
- Extensions of barrier sets to nonzero roots of the matching polynomial
- On the number of P-vertices of some graphs
- Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial
- A sheaf-theoretic approach to pattern matching and related problems
- Matching integral graphs with maximum vertex degree four
- The P-vertex problem for symmetric matrices whose associated graphs admit perfect matchings
- New families of trees determined by their spectra
- Eigenvalues of universal covers and the matching polynomial
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
This page was built for publication: Algebraic matching theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804180)
