The following pages link to Eigenvalues and perfect matchings (Q1765910):
Displaying 26 items.
- Thin trees in some families of distance-regular graphs (Q4965921) (← links)
- A Proof of Brouwer's Toughness Conjecture (Q4990394) (← links)
- Eigenvalues and triangles in graphs (Q4993261) (← links)
- DISTANCE LAPLACIAN SPECTRUM OF THE COMMUTING GRAPH OF FINITE CA-GROUPS (Q5064390) (← 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)
- The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number (Q6041869) (← links)
- Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
- Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS (Q6082047) (← links)
- Matchings in graphs from the spectral radius (Q6116931) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
- Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs (Q6562884) (← links)
- Fractional matchings in graphs from the spectral radius (Q6564841) (← links)
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs (Q6570042) (← links)
- Path factors in bipartite graphs from size or spectral radius (Q6614061) (← links)
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs (Q6615460) (← links)
- A unified combinatorial view beyond some spectral properties (Q6635841) (← links)
- Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs (Q6650589) (← links)
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius (Q6667372) (← links)
