Related papers: Intersection graph and writhe polynomial

Motivated by the problem of matching vertices in two correlated Erd\H{o}s-R\'enyi graphs, we study the problem of matching two correlated Gaussian Wigner matrices. We propose an iterative matching algorithm, which succeeds in polynomial…

In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…

We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…

Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in $\mathbb{S}^3$. Later Horiuchi and Ohyama defined Gordian complex of virtual knots using $v$-move and forbidden…

We are interested in constructing zonotopes which are combinatorially nonequivalent but have the same face vector. In this paper we introduce a quadrilateral flip operation on graphs. We show that, if one graph is obtained from another…

In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of $4$-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present…

We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show…

This paper studies an algebraic invariant of virtual knots called the biquandle. The biquandle generalizes the fundamental group and the quandle of virtual knots. The approach taken in this paper to the biquandle emphasizes understanding…

We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple…

Two plane analytic branches are topologically equivalent if and only if they have the same multiplicity sequence. We show that having same semigroup is equivalent to having same multiplicity sequence, we calculate the semigroup from a…

We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straight-line-segment intersection graphs, but solvable in…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

We succeed to generalize spun knots of classical 1-knots to the virtual 1-knot case by using the `spinning construction'. That, is, we prove the following: Let $Q$ be a spun knot of a virtual 1-knot $K$ by our method. The embedding type $Q$…

In this note we present an infinite family of 2-connected graphs such that their matching polynomials have only integer zeros. This answers in negative a question of Akbari et al. [Graphs with integer matching polynomial zeros, Discrete…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…

The knots-quivers correspondence states that various characteristics of a knot are encoded in the corresponding quiver and the moduli space of its representations. However, this correspondence is not a bijection: more than one quiver may be…

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is…

We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.