The vertex relation of A4 graph in a Mathieu group

Let G be a finite group, and X is a G-conjugacy class of the elements of order three. Additionally, the A4 graph of G is defined as A4(G, X), which is the undirected simple graph with vertex set X. Two distinct vertices x, y ∈ X are linked if and only if both vertices satisfy xy−1 = yx−1. Therefore,...

Full description

Saved in:
Bibliographic Details
Published in:AIP conference proceedings 2024-09, Vol.3150 (1)
Main Authors: Kasim, S. M., Soh, S. C., Aslam, S. N. A. M.
Format: Article
Language:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let G be a finite group, and X is a G-conjugacy class of the elements of order three. Additionally, the A4 graph of G is defined as A4(G, X), which is the undirected simple graph with vertex set X. Two distinct vertices x, y ∈ X are linked if and only if both vertices satisfy xy−1 = yx−1. Therefore, this expanded the analysis of the A4 graph while investigating several properties of the Mathieu group M11 including the collapsed adjacency spectrum and energy.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0228674