Related papers: Counting Links and Knots in Complete Graphs
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
In this paper, we explore the concept of total bondage in finite graphs without isolated vertices. A vertex set $D$ is considered a total dominating set if every vertex $v$ in the graph $G$ has a neighbor in $D$. The minimum cardinality of…
There are 46,972 prime knots with crossing number 14. Among them 19,536 are alternating and have arc index 16. Among the non-alternating knots, 17, 477, and 3,180 have arc index 10, 11, and 12, respectively. The remaining 23,762 have arc…
We look at complete minimal surfaces of finite total curvature in $\mathbb{R}^4$. Similarly to the case of complex curves in $\mathbb{C}^2$ we introduce their {\it link at infinity}; we derive the {\it writhe number at infinity} which gives…
In 2023, Gollin, Hendrey, Methuku, Tompkins and Zhang determined the maximum number of cliques in general 1-planar graphs with order $n$. Their extremal examples have connectivity at most three, except for a few small orders. At the…
All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…
A longest path in a graph is called a detour. It is easy to see that a connected graph of minimum degree at least $2$ and order at least $4$ has at least $4$ detours. We prove that if the number of detours in such a graph of order at least…
A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where…
Let $G$ be a graph of order $n$ and let $u,v$ be vertices of $G$. Let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then the average connectivity $\overline{\kappa}(G)$ of $G$, is defined as $…
We study the $\mathbb{CP}^2$-slicing number of knots, i.e. the smallest $m\geq 0$ such that a knot $K\subseteq S^3$ bounds a properly embedded, null-homologous disk in a punctured connected sum $(\#^m\mathbb{CP}^2)^{\times}$. We give a…
We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…
A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil…
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…
We show that there are exactly eight MMIK (minor minimal intrinsically knotted) graphs of order nine.
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…