Related papers: Graph inverse semigroups and their substructures
In this paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$…
The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…
The geometry of inverse semigroups is a natural topic of study, motivated both from within semigroup theory and by applications to the theory of non-commutative $C^*$-algebras. We study the relationship between the geometry of an inverse…
In this article we will study semigroupoids, and more specifically inverse semigroupoids. These are a common generalization to both inverse semigroups and groupoids, and provide a natural language on which several types of dynamical…
Indecomposible semifinite harmonic functions on the direct product of graded graphs are classified. As a particular case, the full list of indecomposible traces for the infinite inverse symmetric semigroup is obtained.
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup $S\leq T_n$, we construct the kernel graph…
This paper explores the properties of directed graphs, termed generalized action graphs, which exhibit a strong connection to certain number sequences. Focusing on the structural and combinatorial aspects, we investigate the conditions…
We prove that the structure of right generalized inverse semigroups is determined by free \'etale actions of inverse semigroups. This leads to a tensor product interpretation of Yamada's classical struture theorem for generalized inverse…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…
Recently we have shown that the equivalence classes of metrics on the double of a metric space $X$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $X$, which is more…
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful…
The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of…
The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are adjacent if and only if either $u=v^m$ or $v=u^n$ for…
As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $\mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…