DSpace Repository

On the Connectivity and Equality of Some Graphs on Finite Semigroups

Show simple item record

dc.contributor.author Kumar, Jitender
dc.date.accessioned 2023-08-11T09:59:51Z
dc.date.available 2023-08-11T09:59:51Z
dc.date.issued 2022-11
dc.identifier.uri https://link.springer.com/article/10.1007/s40840-022-01411-z
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11326
dc.description.abstract In this paper, we study various graphs, namely Colon power graph, cyclic graph, enhanced power graph, and commuting graph on a semigroup S. The purpose of this paper is twofold. First, we study the interconnection between the diameters of these graphs on semigroups having one idempotent. Consequently, the results on the connectedness and the diameter of the proper enhanced power graphs (or cyclic graph) of finite groups, viz., symmetric group and alternating group, are obtained. In the other part of this paper, for an arbitrary pair of these four graphs, we classify finite semigroups such that the graphs in this pair are equal. Our results generalize some of the corresponding results of these graphs on groups to semigroups. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Mathematics en_US
dc.subject Graphs en_US
dc.title On the Connectivity and Equality of Some Graphs on Finite Semigroups en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account