Related papers: Graph-Links
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
Traditional convolutional neural networks are limited to handling Euclidean space data, overlooking the vast realm of real-life scenarios represented as graph data, including transportation networks, social networks, and reference networks.…
We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…
We construct the new non-trivial state--sum invariants for virtual knots and links by a generalization of the powerful Carter--Saito--Jelsovsky--Kamada--Langford theorem for classical knots. The main result of this work is based on…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
Graph theory is a promising approach in handling the problem of estimating the connectivity probability of vehicular ad-hoc networks (VANETs). With a communication network represented as graph, graph connectivity indicators become valid for…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
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 construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The…
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general…
Link prediction is a key problem for network-structured data. Link prediction heuristics use some score functions, such as common neighbors and Katz index, to measure the likelihood of links. They have obtained wide practical uses due to…
I present a summary of the recent progress made in field and string theory which has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be described in…
Graph embedding methods aim at finding useful graph representations by mapping nodes to a low-dimensional vector space. It is a task with important downstream applications, such as link prediction, graph reconstruction, data visualization,…
We consider several classes of knotted objects, namely usual, virtual and welded pure braids and string links, and two equivalence relations on those objects, induced by either self-crossing changes or self-virtualizations. We provide a…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
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…
This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…