Related papers: On the fibration of augmented link complements
We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the…
In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…
In this paper, we show that two flat fully augmented links with homeomorphic complements must be equivalent as links in $\mathbb{S}^{3}$. This requires a careful analysis of how totally geodesic surfaces and cusps intersect in these link…
We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.
Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement…
We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure,…
We generalize a theorem of Finkelstein and Moriah and show that if a link $L$ has a $2n$-plat projection satisfying certain conditions, then its complement contains some closed essential surfaces. In most cases these surfaces remain…
In this paper we study the connectedness of the fibers of integrable systems that extend complexity one $T$-spaces with proper moment maps, assuming that every tall singular point is non-degenerate. Our main result states that if there are…
We study the relation between augmentations and sheaves in the context of framed oriented links. In this set up, we find slightly more sheaves than augmentations. After removing the sporadic sheaves, we construct a bijective correspondence…
This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the…
We show that all two-bridge knot and link complements are virtually fibered. We also show that spherical Montesinos knot and link complements are virtually fibered. This is accomplished by showing that such knot complements are finitely…
Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication networks. In this variant, we consider a given physical…
By applying Seifert's algorithm to a special alternating diagram of a link L, one obtains a Seifert surface F of L. We show that the support of the sutured Floer homology of the sutured manifold complementary to F is affine isomorphic to…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More…
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…
In Connectivity Augmentation problems we are given a graph $H=(V,E_H)$ and an edge set $E$ on $V$, and seek a min-size edge set $J \subseteq E$ such that $H \cup J$ has larger edge/node connectivity than $H$. In the Edge-Connectivity…
Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the…
This paper examines number theoretic and topological properties of fully augmented pretzel link complements. In particular, we determine exactly when these link complements are arithmetic and exactly which are commensurable with one…
Increasing the connectivity of a graph is a pivotal challenge in robust network design. The weighted connectivity augmentation problem is a common version of the problem that takes link costs into consideration. The problem is then to find…