Files in this item
Superpower graphs of finite groups
Item metadata
dc.contributor.author | Kumar, Ajay | |
dc.contributor.author | Selvaganesh, Lavanya | |
dc.contributor.author | Cameron, Peter J. | |
dc.contributor.author | Chelvam, T. Tamizh | |
dc.date.accessioned | 2024-05-03T14:30:12Z | |
dc.date.available | 2024-05-03T14:30:12Z | |
dc.date.issued | 2024-04-03 | |
dc.identifier | 299013729 | |
dc.identifier | 5c9690c6-f4c5-4116-9867-f444de5ad5f3 | |
dc.identifier | 85189702714 | |
dc.identifier.citation | Kumar , A , Selvaganesh , L , Cameron , P J & Chelvam , T T 2024 , ' Superpower graphs of finite groups ' , Journal of Algebra and Its Applications , vol. Online Ready . https://doi.org/10.1142/S0219498825502147 | en |
dc.identifier.issn | 0219-4988 | |
dc.identifier.other | ORCID: /0000-0003-3130-9505/work/159010055 | |
dc.identifier.uri | https://hdl.handle.net/10023/29806 | |
dc.description | Funding: Ajay Kumar is supported by CSIR-UGC JRF, New Delhi, India, through Ref No.: 19/06/2016(i) EU-V/Roll No. 417267. Lavanya Selvaganesh is partially supported by SERB, India, through Grant No. MTR/2018/000254 under the scheme MATRICS. T. Tamizh Chelvam is supported by CSIR Emeritus Scientist Scheme of Council of Scientific and Industrial Research (No.21(1123)/20/EMR-II), Government of India. | en |
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. | |
dc.format.extent | 392229 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebra and Its Applications | en |
dc.subject | Superpower graph | en |
dc.subject | Power graph | en |
dc.subject | Hamiltonian cycle | en |
dc.subject | Simple group | en |
dc.subject | Vertex connectivity | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Superpower graphs of finite groups | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1142/S0219498825502147 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2024-04-03 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.