Abstract
In this paper, we first present the properties of the graph which maximize the spectral radius among all graphs with prescribed degree sequence. Using these results, we provide a somewhat simpler method to determine the unicyclic graph with maximum spectral radius among all unicyclic graphs with a given degree sequence. Moreover, we determine the bicyclic graph which has maximum spectral radius among all bicyclic graphs with a given degree sequence.
| Original language | English |
|---|---|
| Pages (from-to) | 425-441 |
| Number of pages | 17 |
| Journal | Kyungpook Mathematical Journal |
| Volume | 54 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2014 |
User-Defined Keywords
- Bicyclic graph
- Degree sequence
- Pectral radius
- Unicyclic graph