School Seminars and Colloquia

Spectral Graph Theory (XI)

Discrete Structures and Algorithms (Reading Group)

by Sanming Zhou

Institution: The University of Melbourne
Date: Wed 16th May 2012
Time: 1:00 PM
Location: Room 107, Richard Berry Building

Abstract: We will begin to discuss Chapter 3 of Chung's book, `Spectral Graph Theory'. We will see how to upper-bound the diameter of a graph and the distance between two subsets of vertices by using the Laplace eigenvalues of the graph.