### M. E. Taylor Analysis and PDE Seminar – Stefan Steinerberger (UW)

Phillips Hall 385Conformally Rigid Graphs Abstract. Given a graph G=(V,E), the smallest (nonzero) eigenvalue of its Laplacian matrix is a fantastic measure for how connected the graph is (also known as the `algebraic connectivity'); for example: adding edges increases it. What if … Read more