An extremal problem on Q-spectral radii of graphs with given size and matching number
From MaRDI portal
Publication:5870093
Abstract: Brualdi and Hoffman (1985) proposed the problem of determining the maximal spectral radius of graphs with given size. In this paper, we consider the Brualdi-Hoffman type problem of graphs with given matching number. The maximal -spectral radius of graphs with given size and matching number is obtained, and the corresponding extremal graphs are also determined.
Recommendations
- Spectral radius of graphs with given matching number
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The maximal Aα-spectral radius of graphs with given matching number
- Spectral extrema of graphs with bounded clique number and matching number
- On the maximal α-spectral radius of graphs with given matching number
Cites work
- A bound on the spectral radius of graphs with \(e\) edges
- A note on connected bipartite graphs of fixed order and size with maximal index
- An introduction to the theory of graph spectra
- Bounds on the largest eigenvalues of trees with a given size of matching
- Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Eigenvalues and perfect matchings
- Graph theory
- scientific article; zbMATH DE number 5177331 (Why is no real title available?)
- scientific article; zbMATH DE number 3972892 (Why is no real title available?)
- scientific article; zbMATH DE number 4079464 (Why is no real title available?)
- Large matchings from eigenvalues
- Matching theory
- Matchings in regular graphs from eigenvalues
- Minimizing the Laplacian spectral radius of trees with given matching number
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- On bounds for the index of double nested graphs
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalue of a tree with perfect matchings
- On the largest eigenvalues of trees with perfect matchings
- On the maximal index of graphs with a prescribed number of edges
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- On the spectral radius of (0,1)-matrices
- Perfect matchings, eigenvalues and expansion
- Some notes on the threshold graphs
- Spectral characterization of matchings in graphs
- Spectral radius and matchings in graphs
- Spectral radius of graphs with given matching number
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The minimal Laplacian spectral radius of trees with given matching number
- Upper bounds of the energy of triangle-free graphs in terms of matching number
Cited in
(18)- On \(Q\)-integral graphs with \(Q\)-spectral radius 6
- Ordering graphs with given size by their signless Laplacian spectral radii
- Extremal problems for the p-spectral radius of graphs
- 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
- \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
- Some extremal problems on A_ -spectral radius of graphs with given size
- Maxima of the A_-index of graphs with given size and domination number
- A note on the signless Laplacian spectral ordering of graphs with given size
- Maxima of the \(Q\)-index of leaf-free graphs with given size
- Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
- Maxima of the A_-spectral radius of graphs with given size and minimum degree 2
- Upper bounds on the second largest Laplacian eigenvalue of graphs with given size
- Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs
- An ordering theorem on the Q-spectral radius of graphs with given size and its applications
- Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
- Minimal spectral radius of graphs with given matching number
- Some Turán-type results for the signless Laplacian spectral radius
This page was built for publication: An extremal problem on Q-spectral radii of graphs with given size and matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870093)
