The minimal spectral radius with given independence number
From MaRDI portal
(Redirected from Publication:6185801)
Abstract: In this paper, we determine the graphs which have the minimal spectral radius among all the connected graphs of order and the independence number
The authors show that among simple connected graphs with \(n\) vertices and the independence number \(\lceil n/2\rceil-1\), the minimum spectral radius of adjacency matrix is attained for the cycle when \(n\) is odd, and when \(n\) is even, then for a graph obtained by joining two cycles on approximately \(n/3\) vertices by a path of length approximately \(n/3\), where the exact lengths of the cycles and the path further depend on the value of \(n\) modulo 6.
Recommendations
- The minimum spectral radius of graphs with a given independence number
- Graphs with small independence number minimizing the spectral radius
- The minimum signless Laplacian spectral radius of graphs with given independence number
- Graphs with the minimum spectral radius for given independence number
- The spectral radius of graphs with given order, edge independence number and cycle number
Cites work
- An introduction to the theory of graph spectra
- Graphs with small independence number minimizing the spectral radius
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- scientific article; zbMATH DE number 4972 (Why is no real title available?)
- scientific article; zbMATH DE number 3997840 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- On the spectral radius of bi-block graphs with given independence number \(\alpha\)
- Spectral radius of graphs
- The minimum spectral radius of graphs with a given independence number
- The sharp lower bound for the spectral radius of connected graphs with the independence number
- The spectral radius of graphs with given independence number
- The spectral radius of trees on \(k\) pendant vertices
Cited in
(7)- Graphs with the minimum spectral radius for given independence number
- On the minimum spectral radius of connected graphs of given order and size
- On the minimum spectral radius of graphs with given order and dissociation number
- On the maximum spectral radius of clique trees with a given zero forcing number
- On spectral extrema of graphs with given order and generalized 4-independence number
- Domination number, independent number and minimum spectral radius in unicyclic graphs
- Minimal spectral radius of graphs with given matching number
This page was built for publication: The minimal spectral radius with given independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185801)