On the Graphs Related to Green Relations of Finite Semigroups
Authors
Abstract:
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first attempt to prove that the graphs $Gamma_{D}(S)$ and $Gamma_{H}(S)$ have exactly one connected component, and this graphs for regu- lar semigroups are complete. And secondly, we give a necessary condition for a nite semigroup to be regular. This study shows an intrinsic di er- ence between the conjugacy graphs (of groups) and the Green graphs (of semigroups) as well. Finally, our calculations include two kinds of semi- groups, mostly involving the well known Lucas numbers, and examining the proved assertions.
similar resources
On Weierstrass semigroups arising from finite graphs
In 2007, Baker and Norine proved an analogue of the Riemann-Roch Theorem for finite graphs. Motivated by the Weierstrass semigroup of a point on a nonsingular projective curve X, it is natural to consider analogues for a vertex P on a finite, connected graph which has no loops. Let Hr(P ) be the set of nonnegative integers α such that r(αP ) = r((α − 1)P ) + 1, wherer(D) denotes the dimension o...
full textSemigroups related to subshifts of graphs
We characterise in terms of Zappa-Szép products a class of semigroups which arise from actions of groupoids on semigroups constructed from subshifts of graphs.
full textGreen's Relations in Finite Transformation Semigroups
We consider the complexity of Green’s relations when the semigroup is given by transformations on a finite set. Green’s relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of mag...
full textOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
full textthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولMy Resources
Journal title
volume 9 issue None
pages 43- 51
publication date 2014-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023