Answers are grounded in this paper and cite their sources.
This paper presents a new algorithm for constructing involution graphs for finite groups, indicating these graphs' connectedness and specific properties.
The resize result involution graph of a finite group , is a simple undirected graph whose vertices are the conjugacy classes of and two distinct vertices are adjacent if their representative product is a non-trivial involution. In this paper, we describe an algorithm to obtain the resize result involution graphs. Also, we prove that the resize result involution graphs for , , the Janko groups , the Held group and the exceptional group 2 are connected with diameter at most and girth . We find some properties of the resize result involution graphs. The properties of these graphs are obtained by using GAP and YAGs packages.
No takes yet. Share an insight, caveat, or question.
Kareem et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: