Spectral radius and parity [a,b]-factors in graphs
From MaRDI portal
Publication:7314033
Cites work
- A degree condition for a graph to have \((a,b)\)-parity factors
- A degree condition for the existence ofk-factors
- A note on the spectral radius and \([a,b]\)-factor of graphs
- A sharp upper bound of the spectral radius of graphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Eigenvalues and [a,b]‐factors in regular graphs
- Eigenvalues and \([1,n]\)-odd factors
- Eigenvalues and parity factors in graphs with given minimum degree
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1117461 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectra of graphs
- Spectral conditions for graphs to contain k-factors
- Spectral radius and \([a,b]\)-factors in graphs
- Spectral versions on Lovász's ( a , b )-parity factor theorem in graphs
- Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor
- Sufficient conditions for even factors in graphs
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- The factorization of graphs. II
- The Factors of Graphs
- The spectral radius of trees on \(k\) pendant vertices
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond
This page was built for publication: Spectral radius and parity \([a,b]\)-factors in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314033)
