DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/11326
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Jitender-
dc.date.accessioned2023-08-11T09:59:51Z-
dc.date.available2023-08-11T09:59:51Z-
dc.date.issued2022-11-
dc.identifier.urihttps://link.springer.com/article/10.1007/s40840-022-01411-z-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11326-
dc.description.abstractIn 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.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectGraphsen_US
dc.titleOn the Connectivity and Equality of Some Graphs on Finite Semigroupsen_US
dc.typeArticleen_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.