Related papers: The $n$-adjacency graph for knots

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

Let $G=(V,E)$ be a graph of order $n$ and let $1\leq k< n$ be an integer. The $k$-token graph of $G$ is the graph whose vertices are all the $k$-subsets of $V$, two of which are adjacent whenever their symmetric difference is a pair of…

There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{K_n},P_n)$ defined on a set $\mathcal{V}_n$…

We introduce the notion of adjacency in three-manifolds. A three-manifold $Y$ is $n$-adjacent to another three-manifold $Z$ if there exists an $n$-component link in $Y$ and surgery slopes for that link such that performing Dehn surgery…

The aim of this paper is to define a homology theory for racks with finite rank N and use it to define invariants of knots generalizing the CJKLS 2-cocycle invariants related to the invariants defined in [15]. For this purpose, we prove…

Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are…

In 2013, Adams introduced the $n$-crossing number of a knot $K$, denoted by $c_n(K)$. Inequalities between the $2$-, $3$-, $4$-, and $5$-crossing numbers have been previously established. We prove $c_9(K)\leq c_3(K)-2$ for all knots $K$…

An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

In knot concordance three genera arise naturally, g(K), g_4(K), and g_c(K): these are the classical genus, the 4-ball genus, and the concordance genus, defined to be the minimum genus among all knots concordant to K. Clearly 0 <= g_4(K) <=…

The generalized Kneser graph $K(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-subsets of $\{1,\dots,n\}$ with two vertices adjacent if and only if they share less than $t$ elements. We determine the…

The Johnson graph J(v,k) has, as vertices, the k-subsets of a v-set V, and as edges the pairs of k-subsets with intersection of size k-1. We introduce the notion of a neighbour-transitive code in J(v,k). This is a vertex subset \Gamma such…

In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…

In this paper we define Crossing Change Alternating Knots (CCA knots) and their generalization: $k$-CCA knots.