| dc.contributor.author |
Kumar, Jitender |
|
| dc.date.accessioned |
2023-08-11T09:55:16Z |
|
| dc.date.available |
2023-08-11T09:55:16Z |
|
| dc.date.issued |
2023-04 |
|
| dc.identifier.uri |
https://www.worldscientific.com/doi/10.1142/S0219498824501019 |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11324 |
|
| dc.description.abstract |
The cyclic graph Γ(S) of a semigroup S is the simple undirected graph whose vertex set is S and two vertices x,y are adjacent if the subsemigroup generated by x and y is monogenic. In this paper, we determine the clique number of Γ(S) for an arbitrary semigroup S. Further, we obtain the independence number of Γ(S) if S is a finite monogenic semigroup. At the final part of this paper, we give bounds for independence number of Γ(S) if S is a semigroup of bounded exponent and we also characterize the semigroups attaining the bounds. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
World Scientific |
en_US |
| dc.subject |
Mathematics |
en_US |
| dc.subject |
Monogenic semigroup |
en_US |
| dc.subject |
Completely 0-simple semigroup |
en_US |
| dc.subject |
Independence number |
en_US |
| dc.subject |
Clique number |
en_US |
| dc.subject |
Cyclic graph |
en_US |
| dc.title |
On the clique number and independence number of the cyclic graph of a semigroup |
en_US |
| dc.type |
Article |
en_US |