Pages that link to "Item:Q2066004"
From MaRDI portal
The following pages link to A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004):
Displayed 7 items.
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
- Degree conditions for the existence of a {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factor in a graph (Q6140939) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs (Q6204344) (← links)