THE LARGEST EIGENVALUE ON TREES

The second and third values of the largest eigenvalues of the adjacency matrices of all trees with order m and independence number n(m ≥2n+1,n≥4) were obtained with the transformation of edge removing and joining. Meanwhile all extreme trees reaching the upper bounds are given. These results are important for investigating the other eigenvalues of trees.