Premium
On the spectral radius of a directed graph
Author(s) -
Kwapisz Jaroslaw
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199612)23:4<405::aid-jgt9>3.0.co;2-v
Subject(s) - spectral radius , mathematics , combinatorics , bounded function , graph , radius , degree (music) , upper and lower bounds , discrete mathematics , mathematical analysis , physics , eigenvalues and eigenvectors , computer science , quantum mechanics , computer security , acoustics
We provide upper estimates on the spectral radius of a directed graph. In particular we prove that the spectral radius is bounded by the maximum of the geometric mean of in‐degree and out‐degree taken over all vertices. © 1996 John Wiley & Sons, Inc.