TL;DR
This paper extends knot theory concepts to spatial graphs, specifically 2-bouquet graphs, and calculates their trivializing and knotting numbers based on projections and precrossings.
Contribution
It introduces new methods for computing trivializing and knotting numbers for 2-bouquet spatial graphs and their projections.
Findings
Calculated trivializing and knotting numbers for various projections
Established relationships between precrossings and knotting properties
Extended knot theory concepts to spatial graphs
Abstract
We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet spatial graphs based on the number of precrossings and the placement of the precrossings in the pseudodiagram of the spatial graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.