On the Enhanced Power Graph of a Semigroup

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 $mathcal{P}_e(S)$ of a semigroup $S$ is a simple graph whose vertex set is $S$ and two vertices $x,yinS$ are adjacent if and only if $x,yinlanglezangle$ for some $zinS$, where $langlezangle$ is the subsemigroup generated by $z$. In this paper, first we described the structure of $mathcal{P}_e(S)$ for an arbitrary semigroup $S$. Consequently, we discussed the connectedness of $mathcal{P}_e(S)$. Further, we characterized the semigroup $S$ such that $mathcal{P}_e(S)$ is complete, bipartite, regular, tree and null graph, respectively. Also, we have investigated the planarity together with the minimum degree and independence number of $mathcal{P}_e(S)$. The chromatic number of a spanning subgraph, viz. the cyclic graph, of $mathcal{P}_e(S)$ is proved to be countable. At the final part of this paper, we construct an example of a semigroup $S$ such that the chromatic number of $mathcal{P}_e(S)$ need not be countable.

Full work available at URL: https://arxiv.org/abs/2107.11793

zbMATH Keywords

planar graphmonogenic semigroupcompletely regular semigroupenhanced power graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semigroups (20M99)

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)