Regular factors and eigenvalues of regular graphs
From MaRDI portal
Publication:404439
DOI10.1016/j.ejc.2014.05.007zbMath1297.05146OpenAlexW2046706140MaRDI QIDQ404439
Publication date: 4 September 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.05.007
Related Items (12)
Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Graph toughness from Laplacian eigenvalues ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Unnamed Item ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular factors of regular graphs from eigenvalues
- Spectra of graphs
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- Regular factors of simple regular graphs and factor-spectra
- Eigenvalues and perfect matchings
- Regular Graphs, Eigenvalues and Regular Factors
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Regular factors of regular graphs
- Subgraphs with prescribed valencies
- On factorisation of graphs
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Regular factors and eigenvalues of regular graphs
