Pages that link to "Item:Q1003830"

The following pages link to Matchings in regular graphs from eigenvalues (Q1003830):

Displaying 41 items.

• Spectral radius and fractional matchings in graphs (Q268270) (← links)
• Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
• Matchings in graphs of odd regularity and girth (Q394288) (← links)
• The spectrum and toughness of regular graphs (Q403562) (← links)
• Regular factors and eigenvalues of regular graphs (Q404439) (← links)
• The extendability of matchings in strongly regular graphs (Q405235) (← links)
• Cospectral regular graphs with and without a perfect matching (Q482228) (← 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)
• Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) (← links)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs (Q2075522) (← links)
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number (Q2075523) (← links)
• Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
• On the \(A_\alpha\)-spectral radius of graphs without large matchings (Q2091147) (← links)
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree (Q2093104) (← links)
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
• Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues (Q2185908) (← links)
• Maximum bisections of graphs without short even cycles (Q2229167) (← links)
• Spectral radius and matchings in graphs (Q2229492) (← links)
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs (Q2238866) (← links)
• Matching extendability and connectivity of regular graphs from eigenvalues (Q2303429) (← links)
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree (Q2312657) (← links)
• Eigenvalues and parity factors in graphs with given minimum degree (Q2685325) (← links)
• Sharp spectral bounds for the vertex-connectivity of regular graphs (Q2687918) (← links)
• Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs (Q2699581) (← links)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
• Regular Graphs, Eigenvalues and Regular Factors (Q2891046) (← links)
• The chromatic index of strongly regular graphs (Q3390046) (← 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)
• The matchings and spectral radius of graphs involving minimum degree (Q6102093) (← links)
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)