Abstract: In words, expander graphs are highly connected sparse graphs. They are used in theoretical computer science, combinatorics, functional analysis, and so on. It is known that expander graphs are characterized by the second eigenvalues of the Laplacians on the graphs. In this talk, we give relations between expander graphs and higher eigenvalues of the Laplacians on graphs.