Super graphs on groups, I

G. Arunkumar; Peter J. Cameron; Rajat Kanti Nath; Lavanya Selvaganesh

doi:10.1007/s00373-022-02496-w

Super graphs on groups, I

G. Arunkumar, Peter J. Cameron^*, Rajat Kanti Nath, Lavanya Selvaganesh

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	100
Number of pages	14
Journal	Graphs and Combinatorics
Volume	38
Issue number	3
Early online date	23 May 2022
DOIs	https://doi.org/10.1007/s00373-022-02496-w
Publication status	Published - Jun 2022

Keywords

Power graph
Commuting graph
Conjugacy
2-Engel groups
EPPO groups

Access to Document

10.1007/s00373-022-02496-wLicence: CC BY

Arunkumar-2022-Super-graphs-on-groups-G&C-38-3-100-CCBY
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/.
Final published version, 267 KBLicence: CC BY

1 Article

Super graphs on groups, II
Arunkumar, G., Cameron, P. J. & Nath, R. K., 31 Dec 2024, In: Discrete Applied Mathematics. 359, p. 371-382 12 p.
Research output: Contribution to journal › Article › peer-review

Cite this

@article{1c17e2c5c8924902abb587032baeb925,

title = "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, wecharacterize the groups for which the graphs are complete, andin most cases, we characterize the dominant vertices (those joined to allothers). Also, we give some results about universality, perfectness, and cliquenumber.",

keywords = "Power graph, Commuting graph, Conjugacy, 2-Engel groups, EPPO groups",

author = "G. Arunkumar and Cameron, {Peter J.} and Nath, {Rajat Kanti} and Lavanya Selvaganesh",

year = "2022",

month = jun,

doi = "10.1007/s00373-022-02496-w",

language = "English",

volume = "38",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Super graphs on groups, I

AU - Arunkumar, G.

AU - Cameron, Peter J.

AU - Nath, Rajat Kanti

AU - Selvaganesh, Lavanya

PY - 2022/6

Y1 - 2022/6

N2 - 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, wecharacterize the groups for which the graphs are complete, andin most cases, we characterize the dominant vertices (those joined to allothers). Also, we give some results about universality, perfectness, and cliquenumber.

AB - 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, wecharacterize the groups for which the graphs are complete, andin most cases, we characterize the dominant vertices (those joined to allothers). Also, we give some results about universality, perfectness, and cliquenumber.

KW - Power graph

KW - Commuting graph

KW - Conjugacy

KW - 2-Engel groups

KW - EPPO groups

U2 - 10.1007/s00373-022-02496-w

DO - 10.1007/s00373-022-02496-w

M3 - Article

SN - 0911-0119

VL - 38

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

M1 - 100

ER -

Super graphs on groups, I

Abstract

Keywords

Access to Document

Fingerprint

Research output

Super graphs on groups, II

Cite this