Matchings in regular graphs from eigenvalues

DOI10.1016/j.jctb.2008.06.008zbMath1205.05177MaRDI QIDQ1003830

Willem H. Haemers, David A. Gregory, Sebastian M. Cioabă

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.06.008

zbMATH Keywords

eigenvalues; spectral radius; matchings

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Eigenvalues and \([1,n\)-odd factors], The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large matchings from eigenvalues
• Spectral bounds for the clique and independence numbers of graphs
• Matching theory
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• Closed walks and eigenvalues of abelian Cayley graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Expander graphs and their applications
• Matrix Analysis