The following pages link to Algebraic matching theory (Q1804180):
Displaying 22 items.
- Graphs with few matching roots (Q367053) (← links)
- Generalizing Tutte's theorem and maximal non-matchable graphs (Q390291) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- Extensions of barrier sets to nonzero roots of the matching polynomial (Q607015) (← links)
- On the number of P-vertices of some graphs (Q616291) (← links)
- Generalized \(D\)-graphs for nonzero roots of the matching polynomial (Q641190) (← links)
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (Q931031) (← links)
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial (Q965239) (← links)
- The independence number of the strong product of cycles (Q1125025) (← links)
- Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners (Q1649082) (← links)
- Null decomposition of trees (Q1690257) (← links)
- Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390) (← links)
- Lower bounds on matching energy of graphs (Q2057601) (← links)
- Atoms of the matching measure (Q2082687) (← links)
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials (Q2111908) (← links)
- On matching integral graphs (Q2179027) (← links)
- Graphs with six distinct matching roots (Q2339593) (← links)
- Gallai-Edmonds structure theorem for weighted matching polynomial (Q2435543) (← links)
- The acyclic matrices with a P-set of maximum size (Q2512796) (← links)
- Trace-minimal graphs and D-optimal weighing designs (Q2576216) (← links)
- THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH (Q5076247) (← links)
- Matching Energy of Graphs with Maximum Degree at Most 3 (Q6047129) (← links)
