On the spectral radius of trees with given independence number
DOI10.1016/J.LAA.2015.09.030zbMATH Open1326.05084OpenAlexW2195949224MaRDI QIDQ896840FDOQ896840
Publication date: 14 December 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.09.030
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- The spectral radius of trees on \(k\) pendant vertices
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Bounds on the largest eigenvalues of trees with a given size of matching
- On the spectral radius of trees with fixed diameter
- On the spectral radius of unicyclic graphs with fixed diameter
- Graphs with small independence number minimizing the spectral radius
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- The minimum spectral radius of graphs with a given independence number
- Title not available (Why is that?)
Cited In (16)
- On the spectral radius of block graphs with prescribed independence number \(\alpha\)
- The \(Q\)-minimizer graph with given independence number
- The spectral radius of graphs with given independence number
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- On the asymptotic behavior of the independence number of a random \((n,n)\)-tree
- On spectral extrema of graphs with given order and dissociation number
- On the independence number of some random trees
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- Disproof of a conjecture on the minimum spectral radius and the domination number
- Graphs with the minimum spectral radius for given independence number
- The minimum spectral radius of graphs with a given domination number
- On the minimum spectral radius of graphs with given order and dissociation number
- Independence number and spectral radius of cactus graphs
- Title not available (Why is that?)
- On the spectral radius of bi-block graphs with given independence number \(\alpha\)
- On extremal spectral radii of uniform supertrees with given independence number
This page was built for publication: On the spectral radius of trees with given independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896840)