数学季刊 ›› 2006, Vol. 21 ›› Issue (1): 129-137.

• • 上一篇    下一篇

关于给直径的(m,n)-树的最大谱半径

  

  1. College of Science, Tianjin University of Commerce, Tianjin 300134, China;Department of Mathematics, University of Petroleum, Dongying 257061, China
  • 收稿日期:2004-10-23 出版日期:2006-03-30 发布日期:2023-12-27
  • 作者简介:CHENG Wei(1963-),male,native of Baiquan,Heilongjiang,M.S.D,an associate professor of Tianjin University of Commerce,engages in mathematics with application.
  • 基金资助:
     Supported by the Department Fund of Science and Technology in Tianjin Higher Education Institutions(20050404);

On the Maximum Spectral Radius of (m,n)-trees with Given Diameter

  1. College of Science, Tianjin University of Commerce, Tianjin 300134, China;Department of Mathematics, University of Petroleum, Dongying 257061, China
  • Received:2004-10-23 Online:2006-03-30 Published:2023-12-27
  • About author:CHENG Wei(1963-),male,native of Baiquan,Heilongjiang,M.S.D,an associate professor of Tianjin University of Commerce,engages in mathematics with application.
  • Supported by:
     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.

关键词:  , spectral radius, diameter, star, path, tree

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.

Key words:  , spectral radius, diameter, star, path, tree

中图分类号: