Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Thursday, May 25, 2017 — 2:30 PM EDT
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.