Related papers: An alternative look at the structure of graph inve…

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…

Every semigroup containing an ideal subgroup is called a homogroup, and it is a grouplike if and only if it has only one central idempotent. On the other hand, a class of algebraic structures covering group-$e$-semigroups…

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…

We associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent…

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.

Let $D$ be a division ring, $n$ a positive integer, and GL$_n(D)$ the general linear group of degree $n$ over $D$. In this paper, we study the induced subgraph of the intersection graph of GL$_n(D)$ generated by all non-trivial proper…

We initiate a study of E-semigroups over convex cones. We prove a structure theorem for E-semigroups which leave the algebra of compact operators invariant. Then we study in detail the CCR flows, E$_0$semigroups constructed from isometric…

Let ${\cal G}=(G,w) $ be a positive-weighted graph, that is a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of positive real numbers; for any distinct vertices $i,j $, we define $D_{i,j}({\cal G})$ to be the…

Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides…

To an inverse semigroup, we associate an \'etale groupoid such that its actions on topological spaces are equivalent to actions of the inverse semigroup. Both the object and the arrow space of this groupoid are non-Hausdorff. We show that…

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

Inspired by the work of Paterson on $C^{\ast}$-algebras of directed graphs, we show how to associate a groupoid $\mathfrak{G}_{\mathcal{G}}$ to an ultragraph $\mathcal{G}$ in such a way that the $C^*$-algebra of $\mathfrak{G}_{\mathcal{G}}$…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

The paper is an overview of recent results on algebraic structures (semigroups, groupoids, algebras, inverse semigroups, and groups) associated with objects with a rich set of partial symmetries. We discuss etale groupoids and inverse…

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…

A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…