Matchings in regular graphs from eigenvalues

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

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

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

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

Related Items

On extension of regular graphs ⋮ Spectral radius and fractional matchings in graphs ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ 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] ⋮ Matchings in graphs of odd regularity and girth ⋮ An odd \([ 1 , b \)-factor in regular graphs from eigenvalues] ⋮ The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ The spectrum and toughness of regular graphs ⋮ Regular factors and eigenvalues of regular graphs ⋮ The extendability of matchings in strongly regular graphs ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ The matchings and spectral radius of graphs involving minimum degree ⋮ Matchings in graphs from the spectral radius ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ On high-girth expander graphs with localized eigenvectors ⋮ Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ An inequality using perfect matchings and Laplacian spread of a graph ⋮ Cospectral regular graphs with and without a perfect matching ⋮ Maximum bisections of graphs without short even cycles ⋮ Spectral radius and matchings in graphs ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ The \(A_\alpha\)-spectral radius and perfect matchings of graphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Spectral conditions for some graphical properties ⋮ Eigenvalues and \([1,n\)-odd factors] ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ Matching extendability and connectivity of regular graphs from eigenvalues ⋮ The chromatic index of strongly regular graphs ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs ⋮ The maximum spectral radius of \(t\)-connected graphs with bounded matching number ⋮ Eigenvalues and triangles in graphs ⋮ Fractional matching number and eigenvalues of a graph ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ Signless Laplacian spectral radius and fractional matchings in graphs ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number

Cites Work