Related papers: Grid diagram for singular links
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…
We review a braid theoretic self-linking number formula and study its applications.
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
We introduce web supercategories of type Q. We describe the structure of these categories and show they have a symmetric braiding. The main result of the paper shows these diagrammatically defined monoidal supercategories provide…
We introduce and investigate dichromatic singular links. We also construct G-Family of singquandles and use them to define counting invariants for unoriented dichromatic singular links. We provide some examples to show that these invariants…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
Arboreal singularities are an important class of Lagrangian singularities. They are conical, meaning that they can be understood by studying their links, which are singular Legendrian spaces in $S^{2n-1}_{\text{std}}$. Loose Legendrians are…
The singular braids with $n$ strands, $n \geq 3$, were introduced independently by Baez and Birman. It is known that the monoid formed by the singular braids is embedded in a group that is known as singular braid group, denoted by $SG_n$.…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the…
We give presentations, in terms of generators and relations, for the monoids of singular braids on closed surfaces. The proof of the validity of these presentations can also be applied to verify, in a new way, the presentations given by…
Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…
In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
We introduce braid monodromy for the discriminant hypersurface in versal unfoldings of hypersurface singularities. Our objective is then to compute this invariant for singularities of Brieskorn Pham type: First we consider the unfolding by…
We analyse the problem of singularity of graphs for hexagonal grid graphs. We introduce methods for transforming weighted graph, which do not change the determinant of adjacency matrix. We use these methods to calculate the determinant of…
We adapt algorithms for resolving the singularities of complex algebraic varieties to prove that the natural map of homology theories from complex bordism to the bordism theory of complex derived orbifolds splits. In equivariant stable…