Related papers: Intersection graph and writhe polynomial
The values of writhe of the most tight conformations, found by the SONO algorithm, of all alternating prime knots with up to 10 crossings are analysed. The distribution of the writhe values is shown to be concentrated around the equally…
We show that all two-bridge knot and link complements are virtually fibered. We also show that spherical Montesinos knot and link complements are virtually fibered. This is accomplished by showing that such knot complements are finitely…
The bipartite-hole-number of a graph $G$, denoted as $\widetilde{\alpha}(G)$, is the minimum number $k$ such that there exist positive integers $s$ and $t$ with $s+t=k+1$ with the property that for any two disjoint sets $A,B\subseteq V(G)$…
The graph isomorphism problem is considered. We assign modified $n$-variable characteristic polynomials for graphs and reduce the graph isomorphism problem to the problem of the polynomials isomorphism. It is required to find out, is there…
In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$-equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that graphs $G$ and $G'$ are $T$-equivalent if $G'$ is obtained from…
Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…
In this paper we show how generalized quaternions, including 2X2 matrices, can be used to find solutions of a non-commuting equation intimately connected with braid groups. These solutions can then be used to find polynomial invariants of…
We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…
An extension of the Artin Braid Group with new operators that generate double and triple intersections is considered. The extended Alexander theorem, relating intersecting closed braids and intersecting knots is proved for double and triple…
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…
We generalize the braid algebra to the case of loops with intersections. We introduce the Reidemeister moves for 4 and 6-valent vertices to have a theory of rigid vertex equivalence. By considering representations of the extended braid…
In \cite{Kim} it is shown that knots in $S_{g} \times S^{1}$ can be presented by virtual diagrams with a decoration, so called, {\em double lines}. In this paper, we study the essential diagram for each knot in $S_{g} \times S^{1}$, which…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
Given two elliptic curves, each of which is associated with a projection map that identifies opposite elements with respect to the natural group structure, we investigate how their corresponding projective images of torsion points…
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no two vertices x in B and y in W are adjacent. In this paper we show that the…
We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six…
Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph…
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
We define a group-valued invariant of virtual knots and relate it to various other group-valued invariants of virtual knots, including the extended group of Silver-Williams and the quandle group of Manturov and Bardakov-Bellingeri. A…
We construct an invariant of virtual knots which is a sliceness obstruction and sensitive to the $\Delta$-move. This invariants works if $\Z_{2}\oplus \Z_{2}$-index of chords is present.