Related papers: Marked Graph Mosaics
In this paper we explore the link between the theory of sheaves on graphs and noncommutative geometry showing that many concepts and constructions in the latter can be generalized and enhanced using methods coming from the former. They…
Graphs are often used to model relationships between entities. The identification and visualization of clusters in graphs enable insight discovery in many application areas, such as life sciences and social sciences. Force-directed graph…
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…
We classify the indexed links corresponding to the union of the closed orbits of non-singular Morse-Smale flows on most graph manifolds. We find that each of this kind of indexed links can be obtained by applying a finite steps of…
We study surface knots in 4-space by using generic planar projections. These projections have fold points and cusps as their singularities and the image of the singular point set divides the plane into several regions. The width (or the…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
We investigate connections between biquandle colorings, quiver enhancements, and several notions of the bridge numbers $b_i(K)$ for virtual links, where $i=1,2$. We show that for any positive integers $m \leq n$, there exists a virtual link…
A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an…
We study immersed surfaces in smooth 4-manifolds via singular banded unlink diagrams. Such a diagram consists of a singular link with bands inside a Kirby diagram of the ambient 4-manifold, representing a level set of the surface with…
Graphs are nowadays ubiquitous in the fields of signal processing and machine learning. As a tool used to express relationships between objects, graphs can be deployed to various ends: I) clustering of vertices, II) semi-supervised…
Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a…
Graphs are quickly emerging as a leading abstraction for the representation of data. One important application domain originates from an emerging discipline called "connectomics". Connectomics studies the brain as a graph; vertices…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
Predicting missing links in complex networks requires algorithms that are able to explore statistical regularities in the existing data. Here we investigate the interplay between algorithm efficiency and network structures through the…
We define numerical link-homotopy invariants of link maps of any number of components, which naturally generalize the Kirk invariant. The Kirk invariant is a link-homotopy invariant of 2-component link maps given by linking numbers of loops…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…