Thursday, May 25, 2017 2:30 pm
-
2:30 pm
EDT (GMT -04:00)
Title: Polynomials of graphs
Speaker: | Krystal Guo |
Affiliation: | University of Waterloo |
Location: | MC 6486 |
Abstract:
The characteristic polynomials and matching polynomials of a graph are well-known graph polynomials. We study a more general graph polynomial, which attains both of the polynomials in special contexts, using a construction from graph embeddings. The underlying theory uses Viennot's theory of heaps.