The following pages link to (Q5481401):
Displayed 19 items.
- Regular factors and eigenvalues of regular graphs (Q404439) (← links)
- Signless Laplacian spectral radius and fractional matchings in graphs (Q785815) (← links)
- Large matchings from eigenvalues (Q869943) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs (Q2238866) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- An inequality using perfect matchings and Laplacian spread of a graph (Q4622859) (← links)
- Spectral conditions for graphs to be β-deficient involving minimum degree (Q4640095) (← links)
- Fractional matching number and eigenvalues of a graph (Q5240735) (← links)
- An extremal problem on <i>Q</i>-spectral radii of graphs with given size and matching number (Q5870093) (← links)
- Fractional matching number and spectral radius of nonnegative matrices of graphs (Q5887668) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
- Binding number, \(k\)-factor and spectral radius of graphs (Q6197802) (← links)