Related papers: Seifert-Tait graphs

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

We prove that ample groupoids with sigma-compact unit spaces are equivalent if and only if they are stably isomorphic in an appropriate sense, and relate this to Matui's notion of Kakutani equivalence. We use this result to show that…

We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete…

A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for…

In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely $t$-constrained de Bruijn…

We show that in a prime, closed, oriented 3-manifold M, equivalent knots are isotopic if and only if the orientation preserving mapping class group is trivial. In the case of irreducible, closed, oriented $3$-manifolds we show the more…

We show that the difference between the Seifert genus and the topological 4-genus of a prime positive braid knot is bounded from below by an affine function of the minimal number of strands among positive braid representatives of the knot.…

A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors…

It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of…

We show by example that there is a Cayley graph, having two invariant random subgraphs X and Y, such that there exists a monotone coupling between them in the sense that $X\subset Y$, although no such coupling can be invariant. Here,…

Berge introduced knots that are primitive/primitive with respect to the genus 2 Heegaard surface, $F$, in $S^3$; surgery on such knots at the surface slope yields a lens space. Later Dean described a similar class of knots that are…

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…

We prove that the principal component of the exchange graph of hearts of a graded skew-gentle algebra can be identified with the corresponding exchange graph of S-graphs, using the geometric models and the intersection formula in…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

This is an expository article on diagrammatic representations of knots and links in various settings via braids.

Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…

A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…

Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsions. When the underlying algebra is $\mathbb{Z}[x]/(x^2)$,…