Superpower graphs of finite groups

dc.contributor.author	Kumar A.
dc.contributor.author	Selvaganesh L.
dc.contributor.author	Cameron P.J.
dc.contributor.author	Tamizh Chelvam T.
dc.date.accessioned	2026-06-24T09:44:07Z
dc.date.issued	2025
dc.description	This paper published with affiliation IIT (BHU), Varanasi in open access mode.
dc.description.Volume	24
dc.description.abstract	For a finite group G, the superpower graph S(G) of G is an undirected simple graph with vertex set G and two vertices are adjacent in S(G) if and only if the order of one divides the order of the other in G. The aim of this paper is to provide tight bounds for the vertex connectivity, discuss Hamiltonian-like properties of superpower graph of finite non-Abelian groups having an element of exponent order. We also give some general results about superpower graphs and their relation to other graphs such as the Gruenberg-Kegel graph. © 2025 World Scientific Publishing Company.
dc.description.issue	9
dc.identifier.doi	https://doi.org/10.1142/S0219498825502147
dc.identifier.issn	2194988
dc.identifier.uri	https://idr-sdlib.iitbhu.ac.in/handle/123456789/24384
dc.language.iso	en
dc.publisher	World Scientific
dc.relation.ispartofseries	Journal of Algebra and its Applications
dc.subject	Mathematical Science
dc.title	Superpower graphs of finite groups
dc.type	Article

Files

Now showing 1 - 1 of 1