...
首页> 外文期刊>Linear Algebra and its Applications >On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive weight set
【24h】

On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive weight set

机译:具有固定匹配数q和正权重集的加权树的(拉普拉斯)谱半径

获取原文
获取原文并翻译 | 示例
           

摘要

Denote by T(n,q, w_1, w_2,?, w_(n-1)) the set of n-vertex weighted trees with matching number q and fixed positive weight set W_(n-1)={ w_1, w_2,?, w _(n-1)}, where w_1, w_2≥?≥w _(n-1)>0. Tan [S.W. Tan, On the sharp upper bound of spectral radius of weighted trees, J. Math. Res. Exposition 29 (2009) 293-301] determined the weighted tree in T(n,q, w_1, w_2,?, w_(n-1)) with the largest adjacent spectral radius, whereas in [S.W. Tan, On the Laplacian spectral radius of weighted trees with a positive weight set, Discrete Math. 310 (2010) 1026-1036] Tan determined the weighted tree in T (n,q, w _1, w_2,?, w_(n-1)) with the largest Laplacian spectral radius. In this paper, we use a unified approach to identify the unique weighted tree in T(n,q, w_1, w_2,?, w _(n-1)) with the largest adjacent spectral radius and largest Laplacian spectral radius, respectively.
机译:用T(n,q,w_1,w_2,?,w_(n-1))表示具有匹配数q和固定正权重集W_(n-1)= {w_1,w_2, ?,w _(n-1)},其中w_1,w_2≥?≥w_(n-1)> 0。谭[S.W. Tan,在加权树光谱半径的尖锐上限上,J。Math。 Res。博览会29(2009)293-301]确定了相邻光谱半径最大的T(n,q,w_1,w_2,α,w_(n-1))中的加权树,而在[S.W. Tan,关于权重集为正的加权树的拉普拉斯谱半径,离散数学。 310(2010)1026-1036] Tan确定了具有最大拉普拉斯谱半径的T(n,q,w _1,w_2,α,w_(n-1))中的加权树。在本文中,我们使用统一的方法来识别T(n,q,w_1,w_2,α,w _(n-1))中具有最大相邻光谱半径和最大拉普拉斯光谱半径的唯一加权树。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号