Let A be an n×n matrix with complex or real elements with eigenvalues λ_1, ..., λ_n. Then the spectral radius ρ(A) of A is ρ(A) = max_(1<=i<=n) left bracketing bar λ_i right bracketing bar , i.e., the largest absolute value (or complex modulus) of its eigenvalues. The spectral radius of a finite graph is defined as the largest absolute value of its graph spectrum, i.e., the largest absolute value of the graph eigenvalues (eigenvalues of the adjacency matrix) .

adjacency matrix | algebraic connectivity | eigenvalue | graph eigenvalue | graph spectrum | Laplacian spectral radius