Title: Polynomials of graphs
|Affiliation:||University of Waterloo|
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.