Related papers: Intersection graph and writhe polynomial

The writhe polynomial is a fundamental invariant of an oriented virtual knot. We introduce a kind of local moves for oriented virtual knots called shell moves. The first aim of this paper is to prove that two oriented virtual knots have the…

We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…

A weak chord index $Ind'$ is constructed for self crossing points of virtual links. Then a new writhe polynomial $W$ of virtual links is defined by using $Ind'$. $W$ is a generalization of writhe polynomial defined in [6]. Based on $W$,…

In this work we describe a new invariant of virtual knots. We show that this transcendental function invariant generalizes several polynomial invariants of virtual knots, such as the writhe polynomial, the affine index polynomial and the…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…

Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results.…

We introduce a new polynomial invariant of virtual knots and links and use this invariant to compute a lower bound on the virtual crossing number and the minimal surface genus.

We introduce two sequences of two-variable polynomials $\{ L^n_K (t, \ell)\}_{n=1}^{\infty}$ and $\{ F^n_K (t, \ell)\}_{n=1}^{\infty}$, expressed in terms of index value of a crossing and $n$-dwrithe value of a virtual knot $K$, where $t$…

We introduce twelve polynomial invariants for long virtual knots, called intersection polynomials, extending and refining the three intersection polynomials for virtual knots. They are defined via intersection numbers of cycles on a closed…

In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, we prove that 6 virtual knots are not…

In this paper we construct new invariants of knotoids including the odd writhe, the parity bracket polynomial, the affine index polynomial and the arrow polynomial, and give an introduction to the theory of virtual knotoids. The invariants…

Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.

Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…

We introduce three kinds of invariants of a virtual knot called the first, second, and third intersection polynomials. The definition is based on the intersection number of a pair of curves on a closed surface. The calculations of…

We show that there are infinitely many pairs of alternating pretzel knots whose Jones polynomials are identical.

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…

We introduce the concept of a relative Tutte polynomial of colored graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this…

The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…