多重性(数学)
数学
特征向量
组合数学
上下界
图形
田
离散数学
整数(计算机科学)
数学分析
计算机科学
物理
量子力学
艺术
文学类
程序设计语言
作者
Fenglei Tian,Yiju Wang
标识
DOI:10.1016/j.laa.2022.07.008
摘要
Let T be a tree on n(≥7) vertices with λ as a positive eigenvalue of multiplicity k. If λ2≥2 is an integer, then we prove that k≤⌊n−43⌋ and all extremal graphs attaining the upper bound are characterized. This result revises and improves the main conclusion of Wong, Zhou and Tian (2020). Moreover, applying this result we investigate the eigenvalue multiplicity of unicyclic graphs. Let G be a unicyclic graph of order n(≥11), which contains λ (λ2≥2 is an integer) as a positive eigenvalue of multiplicity m. Then it is proved that m≤⌊n−23⌋, and all extremal graphs attaining the upper bound are determined. These two upper bounds improve the conclusions of Rowlinson (2010, 2011), respectively.
科研通智能强力驱动
Strongly Powered by AbleSci AI