Firstly, we present some sharp upper bounds on the adjacency spectral radius of graphs, and show that these bounds are somewhat better than the known ones.
首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。
Firstly, we present some sharp upper bounds on the adjacency spectral radius of graphs, and show that these bounds are somewhat better than the known ones.
首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。
应用推荐