A characterization of knots in a spatial graph
by
Kazuko Onda
Graduate School of Mathematics, Tsuda College

For a finite graph G, let C(G) be the set of all cycles of G. Suppose that for each c in C(G), an embedding f_c:c --> S³ is given. A set {f_c  |  c in C(G)} of embeddings is realizable if there is an embedding h:G --> S³ such that the restriction map h|_c is ambient isotopic to f_c for any c in C(G). In this talk on six specified graphs G, we give a necessary and sufficient condition for a set {f_c  |  c in C(G)} to be realizable by using second coefficient of Conway polynomial of knot.

Date received: January 20, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caea-14.