School Seminars and Colloquia

Spectral properties of graphs

Discrete Structures and Algorithms (Seminar)

by Xiaogang Liu

Institution: The University of Melbourne
Date: Wed 13th February 2013
Time: 10:00 AM
Location: Room 213, Richard Berry Building

Abstract: Computing the spectra of graphs is a fundamental and difficult problem in spectral graph theory. During my Ph.D. I will focus on computation and estimation of the spectra of some families of graphs.

In this talk, I will first talk about what I have obtained during the first year of my Ph.D. I will then discuss some research problems that I plan to study in the next two years.

This is my Ph.D. confirmation presentation.