Spectral radius and matchings in graphs

DOI10.1016/j.laa.2020.06.004zbMath1459.05184OpenAlexW3034097073MaRDI QIDQ2229492

Suil O

Publication date: 17 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2020.06.004

zbMATH Keywords

spectral radiusperfect matching

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 (27)

The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Spectral radius and \([a,b\)-factors in graphs] ⋮ The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS ⋮ Unnamed Item ⋮ The matchings and spectral radius of graphs involving minimum degree ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Matchings in graphs from the spectral radius ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Matching extension and distance spectral radius ⋮ 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 ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs ⋮ Perfect matching and distance spectral radius in graphs and bipartite graphs ⋮ 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 ⋮ 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 ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ 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 ⋮ Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number

Cites Work

• Unnamed Item
• Spectral radius and fractional matchings in graphs
• Matching and edge-connectivity in regular graphs
• Matchings in regular graphs from eigenvalues
• Eigenvalues and perfect matchings
• Tight lower bounds on the size of a maximum matching in a regular graph
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• The Factorization of Linear Graphs

This page was built for publication: Spectral radius and matchings in graphs