2021
DOI: 10.24996/ijs.2021.62.8.16
|View full text |Cite
|
Sign up to set email alerts
|

Investigation of Commuting Graphs for Elements of Order 3 in Certain Leech Lattice Groups

Abstract: Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J2, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…Moreover, the action of C G (t) on 3A breaks into the discs of the A4-graph as X C sets for He-conjugacy class C. This can explain in the next table: In this case, we let X=3B and then |X|=7996800. Let t be a fixed in 3B, then C G (t) isomorphic to 3.PSL (3,2). The computational calculation yields that A 4 (He,3B) is connected with diameter 4.…”
Section: Discs Structure Of a 4 (He3a)mentioning
confidence: 99%
See 2 more Smart Citations
“…Moreover, the action of C G (t) on 3A breaks into the discs of the A4-graph as X C sets for He-conjugacy class C. This can explain in the next table: In this case, we let X=3B and then |X|=7996800. Let t be a fixed in 3B, then C G (t) isomorphic to 3.PSL (3,2). The computational calculation yields that A 4 (He,3B) is connected with diameter 4.…”
Section: Discs Structure Of a 4 (He3a)mentioning
confidence: 99%
“…Then the A4-graph is connected with diameter 3. The computational calculations inside GAP [8] led to the following results:  0 (t)={t}, 1 (t)={ (3,4,6), (1,4,6), (2,4,6), (3,5,4), (1,5,4), (2,5,4), (3,6,5), (1,6,5),(2,6,5)},  2 (t)={ (3,4,5), (1,4,5), (2,4,5), (3,5,6), (1,5,6), (2,5,6), (3,6,4), (1,6,4), (2,6,4),…”
Section: A4-graph General Propertiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Then the commuting involution graph is introduced on 𝐺, whose vertex set a subset of involution elements in 𝐺 and two vertices are adjacent if they commute see [1,2]. Furthermore, in [3,4,5] the most popular interest work in this context can be seen. Moreover, involution graphs, which adjacency of two vertices is defined by their product is of order 3, are describe in full details in [6].…”
Section: Introductionmentioning
confidence: 99%