Regular factors of regular graphs from eigenvalues
From MaRDI portal
(Redirected from Publication:612943)
Abstract: Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to guarantee that G has a k-factor. When nk is odd, we give a best upper bound (in terms of r and m) on the second largest eigenvalue that is sufficient to guarantee that G is k-critical.
Recommendations
Cited in
(14)- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Regular factors and eigenvalues of regular graphs
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- Graph toughness from Laplacian eigenvalues
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Eigenvalues and [a,b]‐factors in regular graphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Regular graphs, eigenvalues and regular factors
- Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph
- Eigenvalues and parity factors in graphs with given minimum degree
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
- Spectral radius and \([a,b]\)-factors in graphs
This page was built for publication: Regular factors of regular graphs from eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612943)
