Graphs with given degree sequence and maximal spectral radius

Electronic Journal of Combinatorics

Volumn 15, Issue 1, 2008, Pages 1-9

  Biyikoǧlu, Türker ^a   Leydold, Josef ^b  

^a ISIK UNIVERSITY   (Turkey)

^b VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

Author keywords

Adjacency matrix; Degree sequence; Eigenvectors; Majorization; Perron vector; Spectral radius; Tree

Indexed keywords

EID: 52249084347     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. F. Belardo, E. M. L. Marzi, and S. K. Simić. Some results on the index of unicyclic graphs. Linear Algebra Appl., 416(2-3):1048-1059, 2006.
2. T. Biyikoglu and J. Leydold. Faber-Krahn type inequalities for trees. J. Comb. Theory, Ser. B, 97(2):159-174, 2006.
3. T. Biyikoglu, J. Leydold, and P. F. Stadler. Laplacian Eigenvectors of Graphs. Perron-Frobenius and Faber-Krahn Type Theorems, volume 1915 of Lecture Notes in Mathematics. Springer, 2007.
4. R. A. Brualdi and E. S. Solheid. On the spectral radius of connected graphs. Publ. Inst. Math. (Beograd), 39(53):45-54, 1986.
5. D. Cvetkovic and P. Rowlinson. The largest eigenvalue of a graph: A survey. Linear Multilinear Algebra, 28(1/2):3-33, 1990.
6. D. M. Cvetković, P. Rowlinson, and S. Simić. Eigenspaces of Graphs, volume 66 of Encyclopdia of Mathematics and its Applications. Cambrigdge University Press, Cambridge, UK, 1997.
7. J. Edmonds. Existence of k-edge connected ordinary graphs with prescribed degrees. J. Res. Nat. Bur. Standards Sect. B, 68B:73-74, 1964.
8. R. A. Horn and C. R. Johnson. Matrix Analysis. Reprinted with corrections. Cambridge University Press, 1990.
9. J. Leydold. A Faber-Krahn-type inequality for regular trees. GAFA, Geom. Fund. Anal., 7(2):364-378, 1997.
10. B. Liu, J. Shen, and X. Wang. On the largest eigenvalue of non-regular graphs. J. Comb. Theory, Ser. B, 97(6): 1010-1018, 2007. doi: 10.1016/j.jctb.2007.02.008.
11. O. Melnikov, R. I. Tyshkevich, V. A. Yemelichev, and V. I. Sarvanov. Lectures on Graph Theory. B.I. Wissenschaftsverlag, Mannheim, 1994. Transl. from the Russian by N. Korneenko with the collab. of the authors.
12. A. R. Pruss. Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees. Duke Math. J., 91(3):463-514, 1998.
13. O. Rojo. The spectra of some trees and bounds for the largest eigenvalue of any tree. Linear Algebra Appl., 414(1):199-217, 2006.
14. P. Rowlinson. Graph perturbations. In Surveys in Combinatorics, Proc. 13th Br. Comb. Conf Guildford/UK 1991. Lond. Math. Soc., 1991.
15. J. Shu and Y. Wu. Sharp upper bounds on the spectral radius of graphs. Linear Algebra Appl., 377:241-248, 2004.
16. S. Simic, E. M. L. Marzi, and B. Francesco. On the index of caterpillars. Discrete Math., 308(2-3):324-330, 2008. doi: 10.1016/j.disc.2006.11.046.