1 problem

Let $G$ be a finite simple graph with Laplacian eigenvalues $\mu_1\geq\cdots\geq\mu_n$ and average degree $\overline{d}(G)=2m/n$, where $m$ is the number of edges and $n$ the numbe…