Eigenvalues and \([1,n]\)-odd factors

DOI10.1016/J.LAA.2010.04.002zbMath1207.05123OpenAlexW2030090932MaRDI QIDQ979009

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

zbMATH Keywords

eigenvalueLaplacian eigenvalue\([1, n\)-odd factor]

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (6)

Spectral radius and \([a,b\)-factors in graphs] ⋮ Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ An odd \([ 1 , b \)-factor in regular graphs from eigenvalues] ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Large matchings from eigenvalues
• Matchings in regular graphs from eigenvalues
• On factors with all degrees odd
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• Graph Factors and Matching Extensions

This page was built for publication: Eigenvalues and \([1,n]\)-odd factors