In this paper, we study the spectral radius of graphs of order n with κ(G) ≤ k. We show that among those graphs, the maximal spectral radius is obtained uniquely at Knk, which is the graph obtained by joining k edges from k vertices of K n-1 to an isolated vertex. We also show that the spectral radius of Knk will be very close to n - 2 for a fixed k and a sufficiently large n.
|Number of pages||7|
|Journal||Journal of Mathematical Chemistry|
|Publication status||Published - Aug 2009|
Scopus Subject Areas
- Applied Mathematics
- Energy levels
- Spectral radius