The index of trees with specified maximum degree

Match

Volumn 54, Issue 2, 2005, Pages 351-362

  Simić, Slobodan K ^a,b   Tošić, Dejan V ^b  

^a Faculty of Computer Science   (Serbia)

^b University of Belgrade   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29344459456     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs - Theory and Applications, III revised and enlarged edition, Johan Ambrosius Bart. Verlag, Heidelberg - Leipzig, 1995.
2. D. Cvetković, P. Rowlinson, The largest eigenvalue of a graph: A survey, Linear and Multilinear Algebra, 28(1990), 3-33.
3. D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of Graphs, Cambridge University Press, 1997.
4. D. Cvetković, S. Simić, G. Caporossi, P. Hansen, Variable neighbourhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees, Linear and Multilinear Algebra, 49(2001), No. 2, 143-160.
5. M. Fischermann, I. Gutman, A. Hoffmann, D. Rautenbach, D. Vidović, L. Volkmann, Extremal chemical trees, Z. Naturforsch. 57a(2002), 49-52.
6. M. Fischermann, A. Hoffmann, D. Rautenbach, L. Szekely, L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(2002), 127-137.
7. J.M. Guo, S.W. Tan, On the spectral radius of trees, Linear Algebra Appl. 329(2001), 1-8.
8. Y.P. Hou, J.S. Li, Bounds on the largest eigenvalue of trees with a given size of matching, Linear Algebra Appl., 342(2002), 203-217.
9. L. Lovász, J. Pelikan, On the eigenvalues of trees, Periodica Math. Hung., 3(1973), 175-182.
10. S.V. Pemmaraju, and S.S. Skiena, Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica, Cambridge University Press, 2003.
11. M. Petrović, Z. Radosavljević, Spectrally constrained graphs, Faculty of Science, Kragujevac, Yugoslavia, 2001.
12. E.M. Reingold, J. Nievergelt, N. Deo, Combinatorial Algorithms: Theory and Practice, Englewood Cliffs, New Jersey, Prentice Hall, 1977.
13. S. Simić, E.M. Li Marzi, F. Belardo, On the largest eigenvalue of caterpillars, submitted.
14. D. Stevanović, Bounding the largest eigenvalue of trees in terms of the largest vertex degree, Linear Algebra Appl., 360(2003), 35-42.
15. S. Tan, J. Guo, J. Qi, On the spectral radius of trees with the given diameter d, Chinese Quart. J. Math. 19 (2004) 57-62.
16. D.B. West, Introduction to Graph Theory, Prentice Hall, 1996.
17. B. Wu, E. Xiao, Y. Hong, The spectral radius of trees on k pendant vertices, Linear Algebra Appl., 395(2005), 343-349.
18. G.H. Xu, On the spectral radius of trees with perfect matching, in: Combinatorics and graph theory, World Scientific, Singapore, 1997.