Matchings in graphs from the spectral radius
From MaRDI portal
Publication:6116931
DOI10.1080/03081087.2022.2076799zbMath1518.05124OpenAlexW4280491457MaRDI QIDQ6116931
Suil O, Unnamed Author, Unnamed Author, Unnamed Author
Publication date: 18 July 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2022.2076799
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (2)
The maximum spectral radius of \(t\)-connected graphs with bounded matching number ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral radius and fractional matchings in graphs
- Matching and edge-connectivity in regular graphs
- Spectral radius of graphs with given matching number
- Matchings in regular graphs from eigenvalues
- Eigenvalues and perfect matchings
- Spectral radius and matchings in graphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- The minimal Laplacian spectral radius of trees with given matching number
- The Factorization of Linear Graphs
This page was built for publication: Matchings in graphs from the spectral radius