论文部分内容阅读
Let (V, U) be the vertex-partition of tree T as a bipartite graph. T is called an(m,n)-tree if |V| = m and |U| = n. For given positive integers m, n and d, the maximum spectral radius of all (m, n)-trees on diameter d are obtained, and all extreme graphs are determined.