Large matchings from eigenvalues
From MaRDI portal
Publication:869943
DOI10.1016/j.laa.2006.10.020zbMath1116.05049OpenAlexW2126719431MaRDI QIDQ869943
Sebastian M. Cioabă, David A. Gregory
Publication date: 9 March 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.10.020
Related Items (32)
Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Regular Graphs, Eigenvalues and Regular Factors ⋮ Spectral radius and \([a,b\)-factors in graphs] ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ Regular factors and eigenvalues of regular graphs ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ Expander graphs and gaps between primes ⋮ An inequality using perfect matchings and Laplacian spread of a graph ⋮ Bounds on graph eigenvalues. II ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ The \(A_\alpha\)-spectral radius and perfect matchings of graphs ⋮ Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees ⋮ Spectral conditions for some graphical properties ⋮ On the irregularity of uniform hypergraphs ⋮ Eigenvalues and \([1,n\)-odd factors] ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ Measure-theoretic bounds on the spectral radius of graphs from walks ⋮ A note on spectral radius and degree deviation in graphs ⋮ Matchings in regular graphs from eigenvalues ⋮ Sharp bounds on the eigenvalues of trees ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Fractional matching number and eigenvalues of a graph ⋮ Signless Laplacian spectral radius and fractional matchings in graphs ⋮ New results on α-spectral radius of graphs ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number
Cites Work
This page was built for publication: Large matchings from eigenvalues
