arXiv Analytics

Sign in

arXiv:1801.09075 [math.GT]AbstractReferencesReviewsResources

On Yamada polynomial of spatial graphs obtained by edge replacements

Miaowang Li, Fengchun Lei, Fengling Li, Andrei Vesnin

Published 2018-01-27Version 1

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in the complex plane, described by a system of inequalities. Also, the relation between Yamada polynomial of graphs and the chain polynomial of edge-labelled graphs is obtained.

Related articles: Most relevant | Search more
arXiv:2301.06933 [math.GT] (Published 2023-01-17)
Splittings of Tangles and Spatial Graphs
arXiv:math/0611717 [math.GT] (Published 2006-11-23, updated 2006-12-07)
Yamada Polynomial and Khovanov Cohomology
arXiv:math/0106173 [math.GT] (Published 2001-06-20)
Local moves on spatial graphs and finite type invariants