On construction of some new types of semigroups

Ajmal Ali, Zahid Raza


This paper is about the classification of the commuting graphs of semigroups to some extent. Let $S$ be a finite non-commutative semigroup, its commuting graph, denoted by $G(S)$, is a simple graph (which has no loops and multiple edges) whose sets of vertices are elements of $S$ and whose sets of edges are those elements of $S$ which commute with other elements i.e. for any $a,b \in S$ such that $ab=ba$ for $a \neq b$. In this paper, we construct some new types of semigroup of cyclic tree type graphs, sunflower like graphs, almost complete type graphs and almost ladder type graphs with the help of Monid package of GAP.

Full Text: PDF

Published: 2017-03-23

How to Cite this Article:

Ajmal Ali, Zahid Raza, On construction of some new types of semigroups, Journal of Semigroup Theory and Applications, Vol 2017 (2017), Article ID 4

Copyright © 2017 Ajmal Ali, Zahid Raza. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Journal of Semigroup Theory and Applications

ISSN 2051-2937

Editorial Office: office@scik.org

Copyright ©2017 SCIK Publishing Corporation. All rights reserved.