Related papers: Commuting graphs of inverse semigroups and complet…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
We study groupoids and semigroup C*-algebras arising from graphs of monoids, in the setting of right LCM monoids. First, we establish a general criterion when a graph of monoids gives rise to a submonoid of the fundamental group which is…
In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…
Let $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
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…
We introduce and study a new inverse semigroup associated to a separated graph $(E,C)$, which we call the \emph{Leavitt inverse semigroup}. This semigroup is obtained as a quotient of the separated graph inverse semigroup…
We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…
Let $\Gamma=(\mathcal{V},\mathcal{E})$ be a graph, whose vertices $v\in \mathcal{V}$ are colored black and white and labeled with invertible elements $\lambda_v$ from a commutative and associative ring $R$ containing $\pm 1$. Then we…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
Let $S$ be an inverse semigroup with zero and let $Z(S)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b)…
The semigroup $\mathbf{I}\mathbb{N}_{\infty}$ of all partial co-finite isometries of positive integers is studied. We describe Green's relations on the semigroup $\mathbf{I}\mathbb{N}_{\infty}$, its band and proved that…
The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group -a property that is essential…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…