Super graphs on groups, I
Abstract
Let G be a finite group. A number of graphs with the vertex set G have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful to study them together. In addition, several authors have considered modifying the definition of these graphs by choosing a natural equivalence relation on the group such as equality, conjugacy, or equal orders, and joining two elements if there are elements in their equivalence class that are adjacent in the original graph. In this way, we enlarge the hierarchy into a second dimension. Using the three graph types and three equivalence relations mentioned gives nine graphs, of which in general only two coincide; we find conditions on the group for some other pairs to be equal. These often define interesting classes of groups, such as EPPO groups, 2-Engel groups, and Dedekind groups. We study some properties of graphs in this new hierarchy. In particular, we characterize the groups for which the graphs are complete, and in most cases, we characterize the dominant vertices (those joined to all others). Also, we give some results about universality, perfectness, and clique number.
Citation
Arunkumar , G , Cameron , P J , Nath , R K & Selvaganesh , L 2022 , ' Super graphs on groups, I ' , Graphs and Combinatorics , vol. 38 , no. 3 , 100 . https://doi.org/10.1007/s00373-022-02496-w
Publication
Graphs and Combinatorics
Status
Peer reviewed
ISSN
0911-0119Type
Journal article
Rights
Copyright © The Author(s) 2022. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.