Pages that link to "Item:Q2891046"

The following pages link to Regular Graphs, Eigenvalues and Regular Factors (Q2891046):

Displaying 25 items.

• Regular factors and eigenvalues of regular graphs (Q404439) (← 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)
• 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)
• On the \(A_\alpha\)-spectral radius of graphs without large matchings (Q2091147) (← 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)
• Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← 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)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
• Spectral conditions for graphs to be β-deficient involving minimum degree (Q4640095) (← links)
• Sharp conditions for the existence of an even $[a,b]$-factor in a graph (Q4991404) (← links)
• Eigenvalues and triangles in graphs (Q4993261) (← links)
• (Q5089326) (← links)
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs (Q6046685) (← links)
• Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
• (Q6090845) (← 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)
• A spectral Erdős-Rademacher theorem (Q6564068) (← 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)
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph (Q6648250) (← links)