Discrete Green\'s function and graph isomorphism algorithm


An Huang

14:00:00 - 15:00:00

R202 , Astronomy and Mathematics Building

We discuss a particular graph invariant arises from discrete Green\'s function on a graph, and its potential application to the graph isomorphism problem. We also explain some very basic physics ideas related with the invariant, and discuss what may be needed to clarify the role of this invariant in graph theory. Basic calculus and linear algebra is sufficient to understand most of the mathematics of the talk. This is joint work in progress.