Files in this item
Between the enhanced power graph and the commuting graph
Item metadata
dc.contributor.author | Cameron, Peter J. | |
dc.contributor.author | Kuzma, Bojan | |
dc.date.accessioned | 2022-08-08T15:30:03Z | |
dc.date.available | 2022-08-08T15:30:03Z | |
dc.date.issued | 2023-02 | |
dc.identifier.citation | Cameron , P J & Kuzma , B 2023 , ' Between the enhanced power graph and the commuting graph ' , Journal of Graph Theory , vol. 102 , no. 2 , pp. 295-303 . https://doi.org/10.1002/jgt.22871 | en |
dc.identifier.issn | 0364-9024 | |
dc.identifier.other | PURE: 280548389 | |
dc.identifier.other | PURE UUID: a29c8009-b3bf-49b1-9fa8-d1e66f9dbdef | |
dc.identifier.other | ORCID: /0000-0003-3130-9505/work/117211019 | |
dc.identifier.other | WOS: 000837178300001 | |
dc.identifier.other | Scopus: 85136820241 | |
dc.identifier.uri | https://hdl.handle.net/10023/25793 | |
dc.description | Funding: The second author acknowledges the financial support from the Slovenian Research Agency, ARRS (research core funding No. P1-0222, No. P1-0285, and research project No. N1-0210). | en |
dc.description.abstract | The purpose of this note is to define a graph whose vertex set is a finite group G, whose edge set is contained in that of the commuting graph of G and contains the enhanced power graph of G. We call this graph the deep commuting graph of G. Two elements of G are joined in the deep commuting graph if and only if their inverse images in every central extension of G commute. We give conditions for the graph to be equal to either of the enhanced power graph and the commuting graph, and show that automorphisms of G act as automorphisms of the deep commuting graph. | |
dc.format.extent | 9 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Graph Theory | en |
dc.rights | Copyright © 2022 The Authors. Journal of Graph Theory published by Wiley Periodicals LLC. This is an open access article under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs License, which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made. | en |
dc.subject | Commuting graph | en |
dc.subject | Enhanced power graph | en |
dc.subject | Central extension | en |
dc.subject | Schur multiplier | en |
dc.subject | Bogomolov multiplier | en |
dc.subject | QA Mathematics | en |
dc.subject | Mathematics(all) | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Between the enhanced power graph and the commuting graph | en |
dc.type | Journal article | en |
dc.description.version | Publisher PDF | 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 | https://doi.org/10.1002/jgt.22871 | |
dc.description.status | Peer reviewed | en |
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.