On the Enhanced Power Graph of a Semigroup
From MaRDI portal
Publication:6202895
DOI10.1142/S1005386724000099arXiv2107.11793MaRDI QIDQ6202895FDOQ6202895
Authors: Sandeep Dalal, Jitender Kumar, S. P. Singh
Publication date: 27 February 2024
Published in: Algebra Colloquium (Search for Journal in Brave)
Abstract: The enhanced power graph of a semigroup is a simple graph whose vertex set is and two vertices are adjacent if and only if for some , where is the subsemigroup generated by . In this paper, first we described the structure of for an arbitrary semigroup . Consequently, we discussed the connectedness of . Further, we characterized the semigroup such that is complete, bipartite, regular, tree and null graph, respectively. Also, we have investigated the planarity together with the minimum degree and independence number of . The chromatic number of a spanning subgraph, viz. the cyclic graph, of is proved to be countable. At the final part of this paper, we construct an example of a semigroup such that the chromatic number of need not be countable.
Full work available at URL: https://arxiv.org/abs/2107.11793
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semigroups (20M99)
Cited In (2)
This page was built for publication: On the Enhanced Power Graph of a Semigroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202895)