31 Combinatorics Intro: Diameter, the number of distinct eigenvalues, spectrum of bipartite graphs

Lecture 31 Introduction Combinatorics: Diameter and the number of distinct eigenvalues of a graph, the spectrum of a bipartite graph is symmetric with respect to zero