Spectral radius of graphs with given matching number
From MaRDI portal
Publication:869922
Recommendations
- The maximal Aα-spectral radius of graphs with given matching number
- On the maximal α-spectral radius of graphs with given matching number
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number
- Matchings in graphs from the spectral radius
- On the maximal signless Laplacian spectral radius of graphs with given matching number
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- Bounds on the largest eigenvalues of trees with a given size of matching
- Graph theory
- Inverses of trees
- Matching theory
- On the Laplacian spectral radius of a tree.
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with cut edges
- On the spectral radius of graphs with cut vertices
- The spectral radius of trees on \(k\) pendant vertices
Cited in
(55)- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
- Matching extension and distance spectral radius
- On the largest and least eigenvalues of eccentricity matrix of trees
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Note on extremal graphs with given matching number
- The matchings and spectral radius of graphs involving minimum degree
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs
- The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Spectral radius and fractional perfect matchings in graphs
- Bound on the least eigenvalue of a graph with cut vertices
- Spectral extrema of graphs with bounded clique number and matching number
- \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- On the maximal α-spectral radius of graphs with given matching number
- On the spectral radius of graphs with a given domination number
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The least eigenvalue of a graph with a given domination number
- The least eigenvalue of graphs with given connectivity
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- On the spectral radius of graphs without a star forest
- Spectral radius and matchings in graphs
- Spectral radius and rainbow matchings of graphs
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- The signless p-Laplacian spectral radius of graphs with given matching number
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- The maximum spectral radius of graphs without spanning linear forests
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- Disproof of a conjecture on the minimum spectral radius and the domination number
- On the minimum spectral radius of trees with given matching number.
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- The spectral radius of edge chromatic critical graphs
- Constructing graphs with given spectrum and the spectral radius at most 2
- On maximal energy of line graphs with given parameters
- Spectral conditions for some graphical properties
- The maximal Aα-spectral radius of graphs with given matching number
- Matchings in graphs from the spectral radius
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Spectral characterization of matchings in graphs
- On the \(A_\alpha\)-spectral radius of graphs without large matchings
- On the spectral Turán problem of theta graphs
- Graphs with the minimum spectral radius for given independence number
- Maxima of the \(Q\)-index for \(3 K_3\)-free graphs
- Path factors in bipartite graphs from size or spectral radius
- Spectral extremal problem on disjoint color-critical graphs
- Fractional matchings in graphs from the spectral radius
- Spectral radius and rainbow Hamilton paths of a graph
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
This page was built for publication: Spectral radius of graphs with given matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869922)