Regular factors and eigenvalues of regular graphs
From MaRDI portal
Recommendations
- Regular factors of regular graphs from eigenvalues
- Regular graphs, eigenvalues and regular factors
- Eigenvalues and [a,b]‐factors in regular graphs
- Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
- Edge-connectivity, eigenvalues, and matchings in regular graphs
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- A Short Proof of the Factor Theorem for Finite Graphs
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Eigenvalues and perfect matchings
- Graph theory
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- On factorisation of graphs
- Perfect matchings, eigenvalues and expansion
- Pseudo-random graphs
- Regular factors of regular graphs
- Regular factors of regular graphs from eigenvalues
- Regular factors of simple regular graphs and factor-spectra
- Regular graphs, eigenvalues and regular factors
- Spectra of graphs
- Subgraphs with prescribed valencies
- The Factors of Graphs
Cited in
(19)- Regular factors in regular graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- Graph toughness from Laplacian eigenvalues
- Regular factors of regular graphs from eigenvalues
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Eigenvalues and [a,b]‐factors in regular graphs
- Regular factors of simple regular graphs and factor-spectra
- 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
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
This page was built for publication: Regular factors and eigenvalues of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404439)
