Related papers: Graph-Links
A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if…
Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of…
The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded…
In the present paper, we discuss a way of generalising Vassiliev knot invariants and weight systems to framed chord diagrams having framing 0 and 1.
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
Recent advances in neural networks have solved common graph problems such as link prediction, node classification, node clustering, node recommendation by developing embeddings of entities and relations into vector spaces. Graph embeddings…
Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to…
In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…
Effectively showing the relationships between objects in a dataset is one of the main tasks in information visualization. Typically there is a well-defined notion of distance between pairs of objects, and traditional approaches such as…
Virtual knot theory has experienced a lot of nice features that did not appear in classical knot theory, e.g., parity and picture-valued invariants. In the present paper we use virtual knot theory effects to construct new representations of…
This paper is an introduction to the theory of virtual knots and links and it gives a list of unsolved problems in this subject.
Graphs are widely used as a popular representation of the network structure of connected data. Graph data can be found in a broad spectrum of application domains such as social systems, ecosystems, biological networks, knowledge graphs, and…
A virtual link is said to be almost classical (AC) if it has a homologically trivial representative in some thickened surface $\Sigma \times [0,1]$, where $\Sigma$ is a closed orientable surface. AC links provide a useful window for…
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…
Let $\ell \geqslant 0$ be an integer, and $G$ be a graph without loops. An $\ell$-link of $G$ is a walk of length $\ell$ in which consecutive edges are different. We identify an $\ell$-link with its reverse sequence. The $\ell$-link graph…
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…
Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts focus on traditional…
We show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link…
We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…
Link prediction in graphs is a task that has been widely investigated. It has been applied in various domains such as knowledge graph completion, content/item recommendation, social network recommendations and so on. The initial focus of…