An extremal problem on Q-spectral radii of graphs with given size and matching number
From MaRDI portal
Publication:5870093
DOI10.1080/03081087.2021.1915231zbMath1505.05099arXiv2007.02008OpenAlexW3153153763MaRDI QIDQ5870093
Rui-fang Liu, Jie Xue, Ming-qing Zhai
Publication date: 5 January 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.02008
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)
Related Items (6)
Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size ⋮ Maxima of the \(A_\alpha\)-index of graphs with given size and domination number ⋮ Unnamed Item ⋮ Ordering graphs with given size by their signless Laplacian spectral radii
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
- A note on connected bipartite graphs of fixed order and size with maximal index
- On bounds for the index of double nested graphs
- On the largest eigenvalues of trees with perfect matchings
- Some notes on the threshold graphs
- Spectral radius of graphs with given matching number
- Large matchings from eigenvalues
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- Matchings in regular graphs from eigenvalues
- On the first eigenvalue of bipartite graphs
- On the spectral radius of (0,1)-matrices
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- Matching theory
- On the maximal index of graphs with a prescribed number of edges
- Bounds on the largest eigenvalues of trees with a given size of matching
- On the largest eigenvalue of a tree with perfect matchings
- Eigenvalues and perfect matchings
- A bound on the spectral radius of graphs with \(e\) edges
- Spectral radius and matchings in graphs
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Minimizing the Laplacian spectral radius of trees with given matching number
- Upper bounds of the energy of triangle-free graphs in terms of matching number
- The minimal Laplacian spectral radius of trees with given matching number
- Spectral characterization of matchings in graphs
This page was built for publication: An extremal problem on Q-spectral radii of graphs with given size and matching number