邮箱 English

全部

On Alexander polynomial of graphs

Abstract: Using Alexander modules, one can define a polynomial invariant for a certain class of graphs with a balanced coloring. We will give different interpretations of this polynomial by Kauffman state formula and MOY relations. Moreover, we show it coincides with Viro’s gl(1, 1)-Alexander polynomial of a graph.