A Bite Of Spectral radius

Let λ1, ..., λn be the (real or complex) eigenvalues of a matrix A ∈ Cn×n. Then its spectral radius ρ(A) is defined as:

 

Graphs:

The spectral radius of a finite graph is defined to be the spectral radius of its adjacency matrix.

This definition extends to the case of infinite graphs with bounded degrees of vertices (i.e. there exists some real number C such that the degree of every vertex of the graph is smaller than C). In this case, for the graph G define:

Let γ be the adjacency operator of G:

The spectral radius of G is defined to be the spectral radius of the bounded linear operator γ.

转载于:https://my.oschina.net/magicalee/blog/698149