Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
From MaRDI portal
Publication:3013140
DOI10.1137/100786824zbMath1221.05224OpenAlexW2117353240MaRDI QIDQ3013140
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100786824
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) Connectivity (05C40)
Related Items
Spectral radius and fractional matchings in graphs ⋮ Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ The second largest eigenvalue and vertex-connectivity of regular multigraphs ⋮ Average connectivity and average edge-connectivity in graphs ⋮ Matchings in graphs of odd regularity and girth ⋮ An odd \([ 1 , b \)-factor in regular graphs from eigenvalues] ⋮ Matching and edge-connectivity in regular graphs ⋮ The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number ⋮ A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ Regular factors and eigenvalues of 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 ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Spectral conditions for edge connectivity and packing spanning trees in multigraphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ 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 ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Spectral conditions for some graphical properties ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ A characterization of graphs with given maximum degree and smallest possible matching number. II ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ The maximum spectral radius of \(t\)-connected graphs with bounded matching number ⋮ Fractional matching number and eigenvalues of a graph ⋮ 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 ⋮ A generalization of Petersen's matching theorem
