The following pages link to Large matchings from eigenvalues (Q869943):
Displaying 30 items.
- Regular factors and eigenvalues of regular graphs (Q404439) (← links)
- Spectral conditions for some graphical properties (Q526290) (← links)
- Signless Laplacian spectral radius and fractional matchings in graphs (Q785815) (← links)
- Eigenvalues and \([1,n]\)-odd factors (Q979009) (← links)
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013) (← links)
- Matchings in regular graphs from eigenvalues (Q1003830) (← links)
- Sharp bounds on the eigenvalues of trees (Q1004756) (← links)
- Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees (Q1753081) (← links)
- Measure-theoretic bounds on the spectral radius of graphs from walks (Q2032249) (← links)
- A note on spectral radius and degree deviation in graphs (Q2032846) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs (Q2238866) (← links)
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs (Q2238876) (← links)
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree (Q2312657) (← links)
- Bounds on graph eigenvalues. II (Q2459961) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Regular Graphs, Eigenvalues and Regular Factors (Q2891046) (← links)
- Expander graphs and gaps between primes (Q3529867) (← 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)
- New results on α-spectral radius of graphs (Q5862830) (← 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)
- On the irregularity of uniform hypergraphs (Q6083986) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
