4c5xbzbOr8VQ6K0gWiKenGtw9VbTiO2A1DVniDvERp4jv2tG41ao39Zv5jQv
Current position: Home >> Scientific Research >> Paper Publications

The Yamada polynomial of spatial graphs obtained by edge replacements

Release Time:2019-03-12  Hits:

Indexed by: Journal Article

Date of Publication: 2018-08-01

Journal: JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS

Included Journals: SCIE

Volume: 27

Issue: 9,SI

ISSN: 0218-2165

Key Words: Yamada polynomial; spatial graph; chain polynomial

Abstract: 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-labeled graphs is obtained.

Prev One:Local uniqueness of certain geodesics related to Heegaard splittings

Next One:On weakly keen Heegaard splittings with distance 2