Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11336Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kumar, Jitender | - |
| dc.date.accessioned | 2023-08-11T10:39:21Z | - |
| dc.date.available | 2023-08-11T10:39:21Z | - |
| dc.date.issued | 2020-01 | - |
| dc.identifier.uri | https://dl.acm.org/doi/abs/10.1007/s00373-019-02120-4 | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11336 | - |
| dc.description.abstract | The cyclic graph Γ(S) of a semigroup S is the simple graph whose vertex set is S, two element being adjacent if the subsemigroup generated by these two elements is monogenic. The purpose of this note is to prove that the chromatic number of Γ(S) is at most countable. The present paper generalizes the results of Shitov (Graphs Comb 33(2):485–487, 2017) and the corresponding results on power graph and enhanced power graph of groups obtained by Aalipour et al. (Electron J Comb 24(3):#P3.16, 2017). | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | ACM Digital Library | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Cyclic graph | en_US |
| dc.title | Chromatic Number of the Cyclic Graph of Infinite Semigroup | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Department of Mathematics | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.