数学
超图
光谱半径
组合数学
整数(计算机科学)
半径
订单(交换)
离散数学
特征向量
物理
财务
计算机安全
计算机科学
量子力学
经济
程序设计语言
标识
DOI:10.1016/j.laa.2022.04.014
摘要
Let Γn,k,a and Un,k,a denote respectively the classes of weighted k-uniform hypertrees and connected weighted k-uniform linear and nonlinear unicyclic hypergraphs of order n with the positive integer weights and the fixed total weight sum a, where n, k (k≥3), and a are positive integers with a≥n−1k−1≥2 for Γn,k,a while a≥nk−1≥2 for Un,k,a. Four new and useful operations are proposed for comparing the spectral radii of the weighted hypergraphs under consideration. The weighted hypergraphs having the maximum spectral radii among Γn,k,a and Un,k,a are characterized.
科研通智能强力驱动
Strongly Powered by AbleSci AI