Related papers: Alternative links, homogeneous links, and graphs
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
As a crucial step in extractive document summarization, learning cross-sentence relations has been explored by a plethora of approaches. An intuitive way is to put them in the graph-based neural network, which has a more complex structure…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
This note attempts to understand graph limits as defined by Lovasz and Szegedy (2006)} in terms of harmonic analysis on semigroups. This is done by representing probability distributions of random exchangeable graphs as mixtures of…
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…
We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
We define a grid presentation for singular links i.e. links with a finite number of rigid transverse double points. Then we use it to generalize link Floer homology to singular links. Besides the consistency of its definition, we prove that…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.
We affirmatively address the question of whether the proposed link homotopy invariant $\omega$ of Li is well-defined. It is also shown that if one wishes to adapt the homotopy invariant $\tau$ of Schneiderman-Teichner to a link homotopy…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
Scenarios elicit possibilities that may be ignored otherwise, as well as causal relations between them. Even when too little information is available to assess reliable probabilities, the structure of linkages between evoked alternatives…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…