The non-isolated vertices in the generating graph of a direct powers of simple groups. (Q1935380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some applications of the first cohomology group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3436059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of permutations that generate the symmetric group pairwise. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic generation of finite simple groups. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of elements that pairwise generate a linear group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic generation of finite simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise generating and covering sporadic simple groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clique number of the generating graph of a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product decompositions of quasirandom groups and a Jordan type theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4306343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 05:24, 6 July 2024

scientific article
Language Label Description Also known as
English
The non-isolated vertices in the generating graph of a direct powers of simple groups.
scientific article

    Statements

    The non-isolated vertices in the generating graph of a direct powers of simple groups. (English)
    0 references
    0 references
    0 references
    15 February 2013
    0 references
    Let \(G\) be a finite group. The generating graph \(L(G)\) of \(G\) has its vertices the set of non-identity elements of \(G\) where two vertices are joined if and only if they generate the group \(G\). Many properties of the group \(G\) can equivalently be stated in terms of \(L(G)\). In the paper under review the authors consider a finite non-Abelian simple group \(G\) and let \(G^d\) be the largest 2-generated power of \(G\), and study behavior of \(L(G^d)\) with respect to that of \(L(G)\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite groups
    0 references
    generating graphs
    0 references
    2-generator groups
    0 references
    direct powers of simple groups
    0 references
    diameters of graphs
    0 references
    0 references