| On the Maximum Spectral Radius of （m, n）-trees with Given Diameter |
| |
| 作者姓名： | CHENG Wei TAN Shang-wang |
| |
| 作者单位： | College of Science，Tianjin University of Commerce，Tianjin 300134，China;Department of Mathematics，University of Petroleum，Dongying 257061，China |
| |
| 基金项目： | Supported by the Department Fund of Science and Technology in Tianjin Higher Education Institutions(20050404) |
| |
| 摘 要： | 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.
|
| 关 键 词： | 光谱辐射 直径 恒星 路径 图论 |
On the Maximum Spectral Radius of (m,n)-trees with Given Diameter |
| |
| 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. |
| |
| Authors: | CHENG Wei TAN Shang-wang |
| |
| Institution: | [1]College of Science, Tianjin University of Commerce, Tianjin 300134, China [2]Department of Mathematics, University of Petroleum, Dongying 257061, China |
| |
| Abstract: | 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. |
| |
| Keywords: | spectral radius diameter star path tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
