Ascending, Bridge, and Unknotting Numbers of Knotted Graphs
Bahar Acu, Puttipong Pongtanapaisan, Ritikaa Singhal
Abstract
In this paper we define the ascending number and bridge number for virtual and welded spatial graphs. We prove that the former admits a lower bound in terms of the latter. This relationship allows us to compare different notions of unknotting virtual spatial graphs by crossing changes.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell