Large matchings from eigenvalues
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3211575 (Why is no real title available?)
- Eigenvalues and perfect matchings
- Interlacing eigenvalues and graphs
- Perfect matchings, eigenvalues and expansion
- Pseudo-random graphs
- Spektren endlicher Grafen
Cited in
(40)- Matchings in regular graphs from eigenvalues
- Spectral radius and \(k\)-connectedness of a graph
- Expander graphs and gaps between primes
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Spectral radius and fractional perfect matchings in graphs
- Eigenvalues and perfect matchings
- A note on spectral radius and degree deviation in graphs
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- Signless Laplacian spectral radius and fractional matchings in graphs
- Regular factors and eigenvalues of regular graphs
- Measure-theoretic bounds on the spectral radius of graphs from walks
- On spectral irregularity of graphs
- Path factors in bipartite graphs from size or spectral radius
- Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- A unified combinatorial view beyond some spectral properties
- Spectral radius and \([a,b]\)-factors in graphs
- Bounds on graph eigenvalues. II
- Eigenvalues and \([1,n]\)-odd factors
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Sharp bounds on the eigenvalues of trees
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- Binding number, \(k\)-factor and spectral radius of graphs
- Regular graphs, eigenvalues and regular factors
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Graph rigidity properties of Ramanujan graphs
- Fractional matchings in graphs from the spectral radius
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- Graph toughness from Laplacian eigenvalues
- New results on \(\alpha \)-spectral radius of graphs
- Spectral conditions for some graphical properties
- Fractional matching number and eigenvalues of a graph
- An inequality using perfect matchings and Laplacian spread of a graph
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
- On the irregularity of uniform hypergraphs
- Perfect matchings, eigenvalues and expansion
This page was built for publication: Large matchings from eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869943)
