SUPERPOWER GRAPHS OF FINITE ABELIAN GROUPS

dc.contributor.author	Kumar A.
dc.contributor.author	Selvaganesh L.
dc.contributor.author	Chelvam T.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	68
dc.description.abstract	For a finite group G, the superpower graph S(G) is a simple undirected graph with vertex set G, where two distinct vertices are adjacent if and only if the order of one divides that of the other. The aim of this paper is to provide tight bounds for the vertex connectivity of S(G), together with some structural properties such as maximal domination sets, Hamiltonicity, and its variations for superpower graphs of finite abelian groups. The paper concludes with some open problems. © (2024), (Union Matematica Argentina). All Rights Reserved.
dc.identifier.doi	https://doi.org/10.33044/revuma.4587
dc.identifier.issn	416932
dc.identifier.uri	https://idr-sdlib.iitbhu.ac.in/handle/123456789/24383
dc.language.iso	en
dc.publisher	Union Matematica Argentina
dc.relation.ispartofseries	Revista de la Union Matematica Argentina
dc.subject	Mathematical Science
dc.title	SUPERPOWER GRAPHS OF FINITE ABELIAN GROUPS
dc.type	Article

Files

Now showing 1 - 1 of 1