School Seminars and Colloquia

Spectral graph theory (VI)

Discrete Structures and Algorithms (Reading Group)

by Sanming Zhou


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

Abstract: This will be the sixth presentation on spectral graph theory.

We will first discuss relationships between the number of spanning trees of a graph and its Laplace matrix and eigenvalues. We will then give a brief introduction to random walks on graphs with a focus on their connections with Laplace eigenvalues.