The vertex relation of A 4graph 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

Bibliographic Details
Published in:AIP Conference Proceedings
Main Author: Kasim S.M.; Soh S.C.; Aslam S.N.A.M.
Format: Conference paper
Language:English
Published: American Institute of Physics 2024
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85204981302&doi=10.1063%2f5.0228674&partnerID=40&md5=8e7f46f8b0cc482e0cd11db050c02f4b
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. © 2024 Author(s).
ISSN:0094243X
DOI:10.1063/5.0228674