Eigenvalues and [1,n]-odd factors
DOI10.1016/J.LAA.2010.04.002zbMATH Open1207.05123OpenAlexW2030090932MaRDI QIDQ979009FDOQ979009
Authors: Hongliang Lu, Xu Yang, Zefang Wu
Publication date: 25 June 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.002
Recommendations
eigenvalueLaplacian eigenvalue\([1, n\)-odd factor]
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (9)
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Eigenvalues and [a,b]‐factors in regular graphs
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Odd-Even Factorization Results for Eigenvalue Problems
- Binding number, odd \([1, b]\)-factors and the distance spectral radius
- An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
- Spectral radius and \([a,b]\)-factors in graphs
This page was built for publication: Eigenvalues and \([1,n]\)-odd factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979009)