摘要: 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.
中图分类号:
程伟, 谭尚旺. 关于给直径的(m,n)-树的最大谱半径[J]. 数学季刊, 2006, 21(1): 129-137.
CHENG Wei, TAN Shang-wang. On the Maximum Spectral Radius of (m,n)-trees with Given Diameter[J]. Chinese Quarterly Journal of Mathematics, 2006, 21(1): 129-137.