Abstract

A pseudo diagram of a spatial graph is a spatial graph projection on the $2$-sphere with over/under information at some of the double points. We introduce the trivializing (resp. knotting) number of a spatial graph projection by using its pseudo diagrams as the minimum number of the crossings whose over/under information lead the triviality (resp. nontriviality) of the spatial graph. We determine the set of non-negative integers which can be realized by the trivializing (resp. knotting) numbers of knot and link projections, and characterize the projections which have a specific value of the trivializing (resp. knotting) number.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.