Related papers: Graph-valued invariants of virtual and classical l…
We show a combinatorial argument in the diagram of large class of links, including satellite and hyperbolic links, where for each of which the tunnel number is the minimum possible, the number of its components minus one.
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic connectivity both local and globally over all simple, undirected,…
In the present paper, we define an invariant of free links valued in a free product of some copies of $\mathbb{Z}_{2}$. In \cite{Ma2} the second named author constructed a connection between classical braid group and group presentation…
Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of…
We connect Braided Ribbon Networks to the states of loop quantum gravity. Using this connection we present the reduced link as an invariant which captures information from the embedding of the spin-networks. We also present a means of…
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…
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility,…
We prove that a virtual link diagrams satisfying two conditions on the Khovanov homology is minimal, that is, there is no virtual diagram representing the same link with smaller number of crossings. This approach works for both classical…
We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…
A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…
We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new…
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…
In this paper we conjecture that the Links-Gould invariant of links, that we know is a generalization of the Alexander-Conway polynomial, shares some of its classical features. In particular it seems to give a lower bound for the genus of…
We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have…
Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$. In general, determining the…
Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, it is today possible to produce and analyze social and biological networks with detailed information on the time of occurrence and…
The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…
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.