Abstract
For a finite graph G, let Γ(G) be the set of all cycles of G. Suppose that for each γ∈Γ(G), an embedding ϕγ:γ→S3 is given. A set {ϕγ|γ∈Γ(G)} of embeddings is said to be realizable if there is an embedding f:G→S3 such that the restriction map f|γ is ambient isotopic to ϕγ for any γ∈Γ(G). In this paper on seven specified graphs G, we give a necessary and sufficient condition for the set {ϕγ|γ∈Γ(G)} to be realizable by using the second coefficients of Conway polynomials of knots.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have