Extremal graph characterization from the bounds of the spectral radius of weighted graphs
作者:
Highlights:
•
摘要
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained.
论文关键词:Weighted graph,Adjacency matrix,Spectral radius,Upper bound,Lower bound
论文评审过程:Available online 12 February 2011.
论文官网地址:https://doi.org/10.1016/j.amc.2011.02.033