Large matchings from eigenvalues

DOI10.1016/J.LAA.2006.10.020zbMATH Open1116.05049OpenAlexW2126719431MaRDI QIDQ869943FDOQ869943

Authors: Sebastian Cioaba, D. 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

Recommendations

• Matchings in regular graphs from eigenvalues
• Eigenvalues and perfect matchings
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Perfect matchings, eigenvalues and expansion
• Spectral radius and fractional matchings in graphs

zbMATH Keywords

spectral radius

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Interlacing eigenvalues and graphs
• Title not available (Why is that?)
• Spektren endlicher Grafen
• Pseudo-random graphs
• Eigenvalues and perfect matchings
• Title not available (Why is that?)
• Perfect matchings, eigenvalues and expansion

Cited In (40)

• Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
• Graph rigidity properties of Ramanujan graphs
• Sharp bounds on the eigenvalues of trees
• Fractional matchings in graphs from the spectral radius
• Regular factors and eigenvalues of regular graphs
• Graph toughness from Laplacian eigenvalues
• An inequality using perfect matchings and Laplacian spread of a graph
• New results on \(\alpha \)-spectral radius of graphs
• Eigenvalues and \([1,n]\)-odd factors
• An extremal problem on Q-spectral radii of graphs with given size and matching number
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs
• Spectral radius and fractional perfect matchings in graphs
• On the irregularity of uniform hypergraphs
• Matchings in regular graphs from eigenvalues
• Eigenvalues and perfect matchings
• Fractional matching number and spectral radius of nonnegative matrices of graphs
• Perfect matchings, eigenvalues and expansion
• Measure-theoretic bounds on the spectral radius of graphs from walks
• A note on spectral radius and degree deviation in graphs
• On spectral irregularity of graphs
• Path factors in bipartite graphs from size or spectral radius
• Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
• Expander graphs and gaps between primes
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• Binding number, \(k\)-factor and spectral radius of graphs
• A unified combinatorial view beyond some spectral properties
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Fractional matching number and eigenvalues of a graph
• Regular graphs, eigenvalues and regular factors
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs
• Spectral radius and \(k\)-connectedness of a graph
• Signless Laplacian spectral radius and fractional matchings in graphs
• Bounds on graph eigenvalues. II
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
• Spectral radius and \([a,b]\)-factors in graphs
• Spectral conditions for some graphical properties

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)