The maximum spectral radius of \(t\)-connected graphs with bounded matching number
From MaRDI portal
Publication:2075523
DOI10.1016/j.disc.2021.112775zbMath1482.05219OpenAlexW4200295220MaRDI QIDQ2075523
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112775
Extremal problems in graph theory (05C35) 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 (4)
The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ The matchings and spectral radius of graphs involving minimum degree ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
Cites Work
- Unnamed Item
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Spectra of graphs
- Spectral radius of graphs with given matching number
- Matchings in regular graphs from eigenvalues
- Bounds on the largest eigenvalues of trees with a given size of matching
- Eigenvalues and perfect matchings
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- Spectral radius and matchings in graphs
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Matchings in graphs from the spectral radius
This page was built for publication: The maximum spectral radius of \(t\)-connected graphs with bounded matching number