Related papers: On $k$-transitive closures of directed paths
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which…
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred…
We consider the class of semi-transitively orientable graphs, which is a much larger class of graphs compared to transitively orientable graphs, in other words, comparability graphs. Ever since the concept of a semi-transitive orientation…
Given a graph $G(V, E)$ and a positive integer $k$ ($k \geq 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an…
This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…
Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from s_i to t_i. Schrijver [SICOMP'94] proved that the…
In this paper we describe the dynamics of certain rational maps of the form $k \cdot (x+x^{-1})$ over finite fields of odd characteristic.
In this paper, we investigate the controllability of a class of formation control systems. Given a directed graph, we assign an agent to each of its vertices and let the edges of the graph describe the information flow in the system. We…
We give an explicit construction of a closed curve with constant torsion and everywhere positive curvature. We also discuss the restrictions on closed curves of constant torsion when they are constrained to lie on convex surfaces.
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
Transformers were originally proposed as a sequence-to-sequence model for text but have become vital for a wide range of modalities, including images, audio, video, and undirected graphs. However, transformers for directed graphs are a…
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…
We study the neutral periodic points of the Markov-Dyck shifts of finite strongly connected directed graphs. Under certain hypothesis on the structure of the graphs we show, that the topological conjugacy of their Markov-Dyck shifts implies…
In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We…
An introductory paper to the graph k-colorability problem.
A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…
In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…
In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal…