Eigenvalues and [1,n]-odd factors

DOI10.1016/J.LAA.2010.04.002MaRDI QIDQ979009zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

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)

Recommendations

• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• On factors with all degrees odd
• scientific article; zbMATH DE number 21650
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• \((1,f)\)-factors of graphs with odd property

Cites work

• Eigenvalues and perfect matchings
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Large matchings from eigenvalues
• Matchings in regular graphs from eigenvalues
• On factors with all degrees odd

Cited in

(17)

• Spectral radius and \([a,b]\)-factors in 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
• 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
• Binding number, odd \([1, b]\)-factors and the distance spectral radius
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
• Eigenvalues and spanning tree in regular graphs
• Spectral conditions for a graph to have strong parity factors
• Spectral versions on Lovász's ( a , b )-parity factor theorem in graphs
• Laplacian eigenvalue condition for a graph to have the strong parity property
• A note on the spectral radius and \([a,b]\)-factor of graphs
• Eigenvalues and factors: a survey
• Tight spectral and size conditions for (fractional) (a, b; k)-critical graphs
• Spectral radius and parity \([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)