Back to Search
Start Over
Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Source :
-
Linear Algebra & its Applications . Nov2010, Vol. 433 Issue 6, p1180-1186. 7p. - Publication Year :
- 2010
-
Abstract
- Abstract: In this paper, we characterize the graphs with maximum signless Laplacian or adjacency spectral radius among all graphs with fixed order and given vertex or edge connectivity. We also discuss the minimum signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity. Consequently we give an upper bound of signless Laplacian or adjacency spectral radius of graphs in terms of connectivity. In addition we confirm a conjecture of Aouchiche and Hansen involving adjacency spectral radius and connectivity. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 433
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 52330503
- Full Text :
- https://doi.org/10.1016/j.laa.2010.04.045