AN UPPER BOUND ON THE SPECTRAL RADIUS OF WEIGHTED GRAPHS

Authors : S. SORGUN, Ş. BÜYÜKKÖSE, H. S. ÖZARSLAN

Pages : 517-524

View : 13 | Download : 6

Publication Date : 2013-05-01

Article Type : Research Paper

Abstract :We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of itsadjacency matrix. We obtain another upper bound which is sharp onthe spectral radius of the adjacency matrix and compare with someknown upper bounds with the help of some examples of graphs. Wealso characterize graphs for which the bound is attained.
Keywords : Weighted graph, Adjacency matrix, Spectral radius, Upper bound