Related papers: Graph inverse semigroups and their substructures
We associate a graph $\mathcal{N}_{G}$ with a group $G$ (called the non-nilpotent graph of $G$) as follows: take $G$ as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this paper we study the graph…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
The general ideal of this paper is to answer the following question: given a numerical property of commuting graphs, a class of semigroups $\mathcal{C}$ and $n\in\mathbb{N}$, is it possible to find a semigroup in $\mathcal{C}$ such that the…
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an \emph{Armendariz map} between such semigroups, which preserves many graph-theoretic…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
We study the structure of inverse primitive feebly compact semitopological and topological semigroups. We find conditions when the maximal subgroup of an inverse primitive feebly compact semitopological semigroup $S$ is a closed subset of…
For a given inverse semigroup, one can associate an \'etale groupoid which is called the universal groupoid. Our motivation is studying the relation between inverse semigroups and associated \'etale groupoids. In this paper, we focus on…
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 present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
We examine, in a general setting, a notion of inverse semigroup of left quotients, which we call left I-quotients. This concept has appeared, and has been used, as far back as Clifford's seminal work describing bisimple inverse monoids in…
A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
In the paper we study pseudocompact primitive topological inverse semigroups. We describe the structure of pseudocompact primitive topological inverse semigroups and show that a Tychonoff product of a family of pseudocompact primitive…