数学
组合数学
邻接矩阵
多重性(数学)
特征向量
田
图形
上下界
邻接表
离散数学
艺术
数学分析
物理
文学类
量子力学
作者
Zhibin Du,Yinhao Huang
标识
DOI:10.1016/j.laa.2023.03.028
摘要
Let G be a graph on n vertices. Denote by mG,θ the multiplicity of θ as an eigenvalue of the adjacency matrix of G. In a recent paper, when G is a unicyclic graph, Tian and Wang showed that mG,θ≤⌊n−23⌋ when n≥11 and θ2 is an integer larger than 1. Motivated by it, we establish an upper bound of mG,θ for any fixed real number θ, generalizing the result of Tian and Wang. Some new techniques are developed to realize the generalization.
科研通智能强力驱动
Strongly Powered by AbleSci AI